Recognised as Number
1,010,552
- Positive
- Even
- Composite
- 7 digits
1,010,552 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,010,552
Digit count7
Digit sum14
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 59 × 2,141
Distinct prime factors32, 59, 2,141
Number of divisors16
Sum of divisors σ(n)1,927,800
Aliquot sum917,248sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)496,480integers below n that share no factor with it
Carmichael function λ(n)62,060the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 496,480
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 59, 118, 236, 472, 2,141, 4,282, 8,564, 17,128, 126,319, 252,638, 505,276, 1,010,55216 in total
Arithmetic
Previous number1,010,551
Next number1,010,553
Double2,021,104
Half505,276
Square1,021,215,344,704
Cube1,031,991,209,021,316,608
Square root1,005.262154863≈irrational, shown to 9 decimal places
Cube root100.350503372≈
Negation-1,010,552
Reciprocal9.89558182 × 10^-7≈
Representations
Decimal1,010,552
Binary1111011010110111100020 bits
Octal3665570
HexadecimalF6B78
Base 36LNQW
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, ten thousand, five hundred and fifty-two
Ordinalone million, ten thousand, five hundred and fifty-second
Scientific notation1.010552 × 10^6
Engineering notation1.010552 × 10^6
In other bases
Ternary1220100012212base 3; the most digit-efficient integer base after e: 13 digits
Quinary224314202base 5; one hand: 9 digits
Septenary11406134base 7: 8 digits
Nonary1810185base 9; each digit is two ternary digits: 7 digits
Duodecimal408988base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6667cbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:40:42:32base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T01001T00TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001011110010001000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011110110101101111000
Bit length20 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits7within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being even
Highest set bitbit 19worth 524,288
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes30f 6b 78
Gray code10001101111011000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011110110101101111000
64-bit0000000000000000000000000000000000000000000011110110101101111000
One's complement11111111111100001001010010000111at 32 bits, every bit flipped
Bits reversed00011110110101101111000000000000at 32 bits
Rotated left by 100000000000111101101011011110000at 32 bits, wrapping
Shifted left by 1111101101011011110000= 2,021,104, no wrap
Shifted right by 11111011010110111100= 505,276, discarding the low bit
These bits as a double4.99279027 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,010,552 to the power 21,021,215,344,704
1,010,552 to the power 31,031,991,209,021,316,608
1,010,552 to the power 41,042,880,780,258,909,540,847,616
1,010,552 to the power 51,053,885,258,252,201,554,322,640,044,032
First ten multiples1,010,552, 2,021,104, 3,031,656, 4,042,208, 5,052,760, 6,063,312, 7,073,864, 8,084,416, 9,094,968, 10,105,520
Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 4
Divisible by 8Yes
Divisible by 9No, remainder 5
Divisible by 10No, remainder 2
Divisible by 11No, remainder 4
Divisible by 12No, remainder 8
Divisible by 100No, remainder 52
Collatz (3n + 1) trajectory
Steps to reach 182the total stopping time
Highest value reached1,438,8641× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,010,552 → 505,276 → 252,638 → 126,319 → 378,958 → 189,479 → 568,438 → 284,219 → 852,658 → 426,329 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage101,055,200%
1,010,552% as a decimal10,105.52
1,010,552% of 1001,010,552
1,010,552% of 1,00010,105,520
As a fraction of 1001,010,552/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,010,552
Nerdulate something else
Nothing in mind? Surprise me · today’s page