Recognised as Number
1,385,617
- Positive
- Odd
- Composite
- 7 digits
1,385,617 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,385,617
Digit count7
Digit sum31
Digit product5,040
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation971 × 1,427
Distinct prime factors2971, 1,427
Number of divisors4
Sum of divisors σ(n)1,388,016
Aliquot sum2,399sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,383,220integers below n that share no factor with it
Carmichael function λ(n)691,610the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,383,220
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 971, 1,427, 1,385,6174 in total
Arithmetic
Previous number1,385,616
Next number1,385,618
Double2,771,234
Half692,808.5
Square1,919,934,470,689
Cube2,660,293,841,472,680,113
Square root1,177.122338587≈irrational, shown to 9 decimal places
Cube root111.48447705≈
Negation-1,385,617
Reciprocal7.21700152 × 10^-7≈
Representations
Decimal1,385,617
Binary10101001001001001000121 bits
Octal5222221
Hexadecimal152491
Base 36TP5D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and eighty-five thousand, six hundred and seventeen
Ordinalone million, three hundred and eighty-five thousand, six hundred and seventeenth
Scientific notation1.385617 × 10^6
Engineering notation1.385617 × 10^6
In other bases
Ternary2121101201011base 3; the most digit-efficient integer base after e: 13 digits
Quinary323314432base 5; one hand: 9 digits
Septenary14530462base 7: 8 digits
Nonary2541634base 9; each digit is two ternary digits: 7 digits
Duodecimal569a41base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8d40hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:24:53:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT111TT01011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010110010110010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010010010010010001
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes315 24 91
Gray code111111011011011011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010010010010010001
64-bit0000000000000000000000000000000000000000000101010010010010010001
One's complement11111111111010101101101101101110at 32 bits, every bit flipped
Bits reversed10001001001001001010100000000000at 32 bits
Rotated left by 100000000001010100100100100100010at 32 bits, wrapping
Shifted left by 11010100100100100100010= 2,771,234, no wrap
Shifted right by 110101001001001001000= 692,808, discarding the low bit
These bits as a double6.84585758 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,385,617 to the power 21,919,934,470,689
1,385,617 to the power 32,660,293,841,472,680,113
1,385,617 to the power 43,686,148,371,739,850,600,134,721
1,385,617 to the power 55,107,589,848,405,056,569,006,871,707,857
First ten multiples1,385,617, 2,771,234, 4,156,851, 5,542,468, 6,928,085, 8,313,702, 9,699,319, 11,084,936, 12,470,553, 13,856,170
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 17
Collatz (3n + 1) trajectory
Steps to reach 1160the total stopping time
Highest value reached4,156,8523× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,385,617 → 4,156,852 → 2,078,426 → 1,039,213 → 3,117,640 → 1,558,820 → 779,410 → 389,705 → 1,169,116 → 584,558 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage138,561,700%
1,385,617% as a decimal13,856.17
1,385,617% of 1001,385,617
1,385,617% of 1,00013,856,170
As a fraction of 1001,385,617/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,385,617
Nerdulate something else
Nothing in mind? Surprise me · today’s page