Recognised as Number
1,004,656
- Positive
- Even
- Composite
- 7 digits
1,004,656 is an even 7-digit integer and a composite number. It has 10 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,004,656
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2^4 × 62,791
Distinct prime factors22, 62,791
Number of divisors10
Sum of divisors σ(n)1,946,552
Aliquot sum941,896sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)502,320integers below n that share no factor with it
Carmichael function λ(n)125,580the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 502,320
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 62,791, 125,582, 251,164, 502,328, 1,004,65610 in total
Arithmetic
Previous number1,004,655
Next number1,004,657
Double2,009,312
Half502,328
Square1,009,333,678,336
Cube1,014,033,135,942,332,416
Square root1,002.325296498≈irrational, shown to 9 decimal places
Cube root100.154959751≈
Negation-1,004,656
Reciprocal9.95365578 × 10^-7≈
Representations
Decimal1,004,656
Binary1111010101000111000020 bits
Octal3652160
HexadecimalF5470
Base 36LJ74
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four thousand, six hundred and fifty-six
Ordinalone million, four thousand, six hundred and fifty-sixth
Scientific notation1.004656 × 10^6
Engineering notation1.004656 × 10^6
In other bases
Ternary1220001010111base 3; the most digit-efficient integer base after e: 13 digits
Quinary224122111base 5; one hand: 9 digits
Septenary11353012base 7: 8 digits
Nonary1801114base 9; each digit is two ternary digits: 7 digits
Duodecimal405494base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal65bcgbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:39:4:16base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T0001010111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100110101010110110000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011110101010001110000
Bit length20 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits10within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 19worth 524,288
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes30f 54 70
Gray code10001111111001001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011110101010001110000
64-bit0000000000000000000000000000000000000000000011110101010001110000
One's complement11111111111100001010101110001111at 32 bits, every bit flipped
Bits reversed00001110001010101111000000000000at 32 bits
Rotated left by 100000000000111101010100011100000at 32 bits, wrapping
Shifted left by 1111101010100011100000= 2,009,312, no wrap
Shifted right by 11111010101000111000= 502,328, discarding the low bit
These bits as a double4.96366015 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,004,656 to the power 21,009,333,678,336
1,004,656 to the power 31,014,033,135,942,332,416
1,004,656 to the power 41,018,754,474,223,279,915,728,896
1,004,656 to the power 51,023,497,795,055,263,507,016,529,739,776
First ten multiples1,004,656, 2,009,312, 3,013,968, 4,018,624, 5,023,280, 6,027,936, 7,032,592, 8,037,248, 9,041,904, 10,046,560
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 4Yes
Divisible by 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 2
Divisible by 8Yes
Divisible by 9No, remainder 4
Divisible by 10No, remainder 6
Divisible by 11No, remainder 4
Divisible by 12No, remainder 4
Divisible by 100No, remainder 56
Collatz (3n + 1) trajectory
Steps to reach 1183the total stopping time
Highest value reached1,004,656
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,004,656 → 502,328 → 251,164 → 125,582 → 62,791 → 188,374 → 94,187 → 282,562 → 141,281 → 423,844 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage100,465,600%
1,004,656% as a decimal10,046.56
1,004,656% of 1001,004,656
1,004,656% of 1,00010,046,560
As a fraction of 1001,004,656/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,004,656
Nerdulate something else
Nothing in mind? Surprise me · today’s page