Recognised as Number
1,600,607
- Positive
- Odd
- Prime
- 7 digits
1,600,607 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,600,607
Digit count7
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,600,607
Distinct prime factors11,600,607
Number of divisors2
Sum of divisors σ(n)1,600,608
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,600,606integers below n that share no factor with it
Carmichael function λ(n)1,600,606the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,600,6072 in total
Arithmetic
Previous number1,600,606
Next number1,600,608
Double3,201,214
Half800,303.5
Square2,561,942,768,449
Cube4,100,663,528,778,848,543
Square root1,265.150979133≈irrational, shown to 9 decimal places
Cube root116.975498315≈
Negation-1,600,607
Reciprocal6.24762981 × 10^-7≈
Representations
Decimal1,600,607
Binary11000011011000101111121 bits
Octal6066137
Hexadecimal186C5F
Base 36YB1B
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, six hundred thousand, six hundred and seven
Ordinalone million, six hundred thousand, six hundred and seventh
Scientific notation1.600607 × 10^6
Engineering notation1.600607 × 10^6
In other bases
Ternary10000022121202base 3; the most digit-efficient integer base after e: 14 digits
Quinary402204412base 5; one hand: 9 digits
Septenary16414331base 7: 8 digits
Nonary3008552base 9; each digit is two ternary digits: 7 digits
Duodecimal65233bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimala01a7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:24:36:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10000100T0TT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011011110110100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110000110110001011111
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 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
Bytes318 6c 5f
Gray code101000101101001110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110000110110001011111
64-bit0000000000000000000000000000000000000000000110000110110001011111
One's complement11111111111001111001001110100000at 32 bits, every bit flipped
Bits reversed11111010001101100001100000000000at 32 bits
Rotated left by 100000000001100001101100010111110at 32 bits, wrapping
Shifted left by 11100001101100010111110= 3,201,214, no wrap
Shifted right by 111000011011000101111= 800,303, discarding the low bit
These bits as a double7.90804931 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,600,607 to the power 22,561,942,768,449
1,600,607 to the power 34,100,663,528,778,848,543
1,600,607 to the power 46,563,550,748,808,126,429,865,601
1,600,607 to the power 510,505,665,273,397,528,820,527,890,019,807
First ten multiples1,600,607, 3,201,214, 4,801,821, 6,402,428, 8,003,035, 9,603,642, 11,204,249, 12,804,856, 14,405,463, 16,006,070
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 11
Divisible by 100No, remainder 7
Collatz (3n + 1) trajectory
Steps to reach 1207the total stopping time
Highest value reached24,309,23215× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,600,607 → 4,801,822 → 2,400,911 → 7,202,734 → 3,601,367 → 10,804,102 → 5,402,051 → 16,206,154 → 8,103,077 → 24,309,232 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage160,060,700%
1,600,607% as a decimal16,006.07
1,600,607% of 1001,600,607
1,600,607% of 1,00016,006,070
As a fraction of 1001,600,607/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,600,607
Nerdulate something else
Nothing in mind? Surprise me · today’s page