Recognised as Number
1,566,356
- Positive
- Even
- Composite
- 7 digits
1,566,356 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,566,356
Digit count7
Digit sum32
Digit product16,200
Multiplicative persistence2times 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^2 × 11 × 97 × 367
Distinct prime factors42, 11, 97, 367
Number of divisors24
Sum of divisors σ(n)3,029,376
Aliquot sum1,463,020sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)702,720integers below n that share no factor with it
Carmichael function λ(n)29,280the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 702,720
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 11, 22, 44, 97, 194, 367, 388, 734, 1,067, 1,468, 2,134, 4,037, 4,268, 8,074, 16,148, 35,599, 71,198, 142,396, 391,589, 783,178, 1,566,35624 in total
Arithmetic
Previous number1,566,355
Next number1,566,357
Double3,132,712
Half783,178
Square2,453,471,118,736
Cube3,843,009,207,658,846,016
Square root1,251.541449573≈irrational, shown to 9 decimal places
Cube root116.135098246≈
Negation-1,566,356
Reciprocal6.38424471 × 10^-7≈
Representations
Decimal1,566,356
Binary10111111001101001010021 bits
Octal5763224
Hexadecimal17E694
Base 36XKLW
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and sixty-six thousand, three hundred and fifty-six
Ordinalone million, five hundred and sixty-six thousand, three hundred and fifty-sixth
Scientific notation1.566356 × 10^6
Engineering notation1.566356 × 10^6
In other bases
Ternary2221120122012base 3; the most digit-efficient integer base after e: 13 digits
Quinary400110411base 5; one hand: 9 digits
Septenary16212431base 7: 8 digits
Nonary2846565base 9; each digit is two ternary digits: 7 digits
Duodecimal636558base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal9ffhgbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:15:5:56base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1000TTT1T0T1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010000011101110010100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101111110011010010100
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes317 e6 94
Gray code111000001010111011110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101111110011010010100
64-bit0000000000000000000000000000000000000000000101111110011010010100
One's complement11111111111010000001100101101011at 32 bits, every bit flipped
Bits reversed00101001011001111110100000000000at 32 bits
Rotated left by 100000000001011111100110100101000at 32 bits, wrapping
Shifted left by 11011111100110100101000= 3,132,712, no wrap
Shifted right by 110111111001101001010= 783,178, discarding the low bit
These bits as a double7.73882689 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,566,356 to the power 22,453,471,118,736
1,566,356 to the power 33,843,009,207,658,846,016
1,566,356 to the power 46,019,520,530,471,679,410,237,696
1,566,356 to the power 59,428,712,100,027,497,874,302,276,555,776
First ten multiples1,566,356, 3,132,712, 4,699,068, 6,265,424, 7,831,780, 9,398,136, 10,964,492, 12,530,848, 14,097,204, 15,663,560
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7No, remainder 1
Divisible by 8No, remainder 4
Divisible by 9No, remainder 5
Divisible by 10No, remainder 6
Divisible by 11Yes
Divisible by 12No, remainder 8
Divisible by 100No, remainder 56
Collatz (3n + 1) trajectory
Steps to reach 1176the total stopping time
Highest value reached4,763,2843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,566,356 → 783,178 → 391,589 → 1,174,768 → 587,384 → 293,692 → 146,846 → 73,423 → 220,270 → 110,135 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage156,635,600%
1,566,356% as a decimal15,663.56
1,566,356% of 1001,566,356
1,566,356% of 1,00015,663,560
As a fraction of 1001,566,356/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,566,356
Nerdulate something else
Nothing in mind? Surprise me · today’s page