Recognised as Number
1,007,962
- Positive
- Even
- Composite
- 7 digits
1,007,962 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,007,962
Digit count7
Digit sum25
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 numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 47 × 10,723
Distinct prime factors32, 47, 10,723
Number of divisors8
Sum of divisors σ(n)1,544,256
Aliquot sum536,294sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)493,212integers below n that share no factor with it
Carmichael function λ(n)246,606the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 493,212
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 47, 94, 10,723, 21,446, 503,981, 1,007,9628 in total
Arithmetic
Previous number1,007,961
Next number1,007,963
Double2,015,924
Half503,981
Square1,015,987,393,444
Cube1,024,076,685,070,601,128
Square root1,003.97310721≈irrational, shown to 9 decimal places
Cube root100.264698728≈
Negation-1,007,962
Reciprocal9.92100893 × 10^-7≈
Representations
Decimal1,007,962
Binary1111011000010101101020 bits
Octal3660532
HexadecimalF615A
Base 36LLQY
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seven thousand, nine hundred and sixty-two
Ordinalone million, seven thousand, nine hundred and sixty-second
Scientific notation1.007962 × 10^6
Engineering notation1.007962 × 10^6
In other bases
Ternary1220012122221base 3; the most digit-efficient integer base after e: 13 digits
Quinary224223322base 5; one hand: 9 digits
Septenary11365444base 7: 8 digits
Nonary1805587base 9; each digit is two ternary digits: 7 digits
Duodecimal40738abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal65ji2base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:39:59:22base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T01T0T000T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001010011010101110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011110110000101011010
Bit length20 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits9within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 19worth 524,288
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes30f 61 5a
Gray code10001101000111110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011110110000101011010
64-bit0000000000000000000000000000000000000000000011110110000101011010
One's complement11111111111100001001111010100101at 32 bits, every bit flipped
Bits reversed01011010100001101111000000000000at 32 bits
Rotated left by 100000000000111101100001010110100at 32 bits, wrapping
Shifted left by 1111101100001010110100= 2,015,924, no wrap
Shifted right by 11111011000010101101= 503,981, discarding the low bit
These bits as a double4.97999397 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,007,962 to the power 21,015,987,393,444
1,007,962 to the power 31,024,076,685,070,601,128
1,007,962 to the power 41,032,230,383,637,133,254,181,136
1,007,962 to the power 51,040,449,001,951,652,109,150,926,204,832
First ten multiples1,007,962, 2,015,924, 3,023,886, 4,031,848, 5,039,810, 6,047,772, 7,055,734, 8,063,696, 9,071,658, 10,079,620
Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8No, remainder 2
Divisible by 9No, remainder 7
Divisible by 10No, remainder 2
Divisible by 11No, remainder 10
Divisible by 12No, remainder 10
Divisible by 100No, remainder 62
Collatz (3n + 1) trajectory
Steps to reach 1121the total stopping time
Highest value reached1,511,9441× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,007,962 → 503,981 → 1,511,944 → 755,972 → 377,986 → 188,993 → 566,980 → 283,490 → 141,745 → 425,236 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage100,796,200%
1,007,962% as a decimal10,079.62
1,007,962% of 1001,007,962
1,007,962% of 1,00010,079,620
As a fraction of 1001,007,962/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,007,962
Nerdulate something else
Nothing in mind? Surprise me · today’s page