Recognised as Number
1,071,007
- Positive
- Odd
- Composite
- 7 digits
1,071,007 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,071,007
Digit count7
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 153,001
Distinct prime factors27, 153,001
Number of divisors4
Sum of divisors σ(n)1,224,016
Aliquot sum153,009sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)918,000integers below n that share no factor with it
Carmichael function λ(n)153,000the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 918,000
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 153,001, 1,071,0074 in total
Arithmetic
Previous number1,071,006
Next number1,071,008
Double2,142,014
Half535,503.5
Square1,147,055,994,049
Cube1,228,504,999,018,437,343
Square root1,034.894680632≈irrational, shown to 9 decimal places
Cube root102.312988372≈
Negation-1,071,007
Reciprocal9.33700713 × 10^-7≈
Representations
Decimal1,071,007
Binary10000010101111001111121 bits
Octal4053637
Hexadecimal10579F
Base 36MYE7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seventy-one thousand and seven
Ordinalone million, seventy-one thousand and seventh
Scientific notation1.071007 × 10^6
Engineering notation1.071007 × 10^6
In other bases
Ternary2000102010221base 3; the most digit-efficient integer base after e: 13 digits
Quinary233233012base 5; one hand: 9 digits
Septenary12050320base 7: 8 digits
Nonary2012127base 9; each digit is two ternary digits: 7 digits
Duodecimal437967base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6dha7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:57:30:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00011T0110T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011010100011100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000101011110011111
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
Bytes310 57 9f
Gray code110000111110001010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000101011110011111
64-bit0000000000000000000000000000000000000000000100000101011110011111
One's complement11111111111011111010100001100000at 32 bits, every bit flipped
Bits reversed11111001111010100000100000000000at 32 bits
Rotated left by 100000000001000001010111100111110at 32 bits, wrapping
Shifted left by 11000001010111100111110= 2,142,014, no wrap
Shifted right by 110000010101111001111= 535,503, discarding the low bit
These bits as a double5.29147765 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,071,007 to the power 21,147,055,994,049
1,071,007 to the power 31,228,504,999,018,437,343
1,071,007 to the power 41,315,737,453,483,739,523,414,401
1,071,007 to the power 51,409,164,022,843,259,415,753,487,371,807
First ten multiples1,071,007, 2,142,014, 3,213,021, 4,284,028, 5,355,035, 6,426,042, 7,497,049, 8,568,056, 9,639,063, 10,710,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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 7
Collatz (3n + 1) trajectory
Steps to reach 1121the total stopping time
Highest value reached18,299,17617× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,071,007 → 3,213,022 → 1,606,511 → 4,819,534 → 2,409,767 → 7,229,302 → 3,614,651 → 10,843,954 → 5,421,977 → 16,265,932 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage107,100,700%
1,071,007% as a decimal10,710.07
1,071,007% of 1001,071,007
1,071,007% of 1,00010,710,070
As a fraction of 1001,071,007/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,071,007
Nerdulate something else
Nothing in mind? Surprise me · today’s page