Recognised as Number

1,556,262

Positive
Even
Composite
7 digits

1,556,262 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,556,262

Digit count7

Digit sum27

Digit product3,600

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3^2 × 31 × 2,789

Distinct prime factors42, 3, 31, 2,789

Number of divisors24

Sum of divisors σ(n)3,481,920

Aliquot sum1,925,658sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)501,840integers below n that share no factor with it

Carmichael function λ(n)41,820the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 501,840

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 6, 9, 18, 31, 62, 93, 186, 279, 558, 2,789, 5,578, 8,367, 16,734, 25,101, 50,202, 86,459, 172,918, 259,377, 518,754, 778,131, 1,556,26224 in total

Arithmetic

Previous number1,556,261

Next number1,556,263

Double3,112,524

Half778,131

Square2,421,951,412,644

Cube3,769,190,949,344,176,728

Square root1,247.502304607≈irrational, shown to 9 decimal places

Cube root115.885092316≈

Negation-1,556,262

Reciprocal6.42565326 × 10^-7≈

Representations

Decimal1,556,262

Binary10111101111110010011021 bits

Octal5737446

Hexadecimal17BF26

Base 36XCTI

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, five hundred and fifty-six thousand, two hundred and sixty-two

Ordinalone million, five hundred and fifty-six thousand, two hundred and sixty-second

Scientific notation1.556262 × 10^6

Engineering notation1.556262 × 10^6

In other bases

Ternary2221001210100base 3; the most digit-efficient integer base after e: 13 digits

Quinary344300022base 5; one hand: 9 digits

Septenary16141131base 7: 8 digits

Nonary2831710base 9; each digit is two ternary digits: 7 digits

Duodecimal630746base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimal9ead2base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal7:12:17:42base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary100T101TT10100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11010001100001101111010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101111011111100100110

Bit length21 bitsto write the magnitude

Set bits14the population count, or Hamming weight

Zero bits7within that length

Bit parityeven14 set bits, so even; not the same as the number itself being even

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes317 bf 26

Gray code111000110000010110101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101111011111100100110

64-bit0000000000000000000000000000000000000000000101111011111100100110

One's complement11111111111010000100000011011001at 32 bits, every bit flipped

Bits reversed01100100111111011110100000000000at 32 bits

Rotated left by 100000000001011110111111001001100at 32 bits, wrapping

Shifted left by 11011110111111001001100= 3,112,524, no wrap

Shifted right by 110111101111110010011= 778,131, discarding the low bit

These bits as a double7.6889559 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,556,263+1

Previous prime1,556,251−11

Distance to nearest prime1

Nearest square below1,555,009

Nearest square above1,557,504

Powers & multiples

1,556,262 to the power 22,421,951,412,644

1,556,262 to the power 33,769,190,949,344,176,728

1,556,262 to the power 45,865,848,645,208,267,163,070,736

1,556,262 to the power 59,128,797,344,289,108,271,734,789,748,832

First ten multiples1,556,262, 3,112,524, 4,668,786, 6,225,048, 7,781,310, 9,337,572, 10,893,834, 12,450,096, 14,006,358, 15,562,620

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6Yes

Divisible by 7No, remainder 1

Divisible by 8No, remainder 6

Divisible by 9Yes

Divisible by 10No, remainder 2

Divisible by 11No, remainder 4

Divisible by 12No, remainder 6

Divisible by 100No, remainder 62

Collatz (3n + 1) trajectory

Steps to reach 1269the total stopping time

Highest value reached3,501,5922× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,556,262 → 778,131 → 2,334,394 → 1,167,197 → 3,501,592 → 1,750,796 → 875,398 → 437,699 → 1,313,098 → 656,549 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage155,626,200%

1,556,262% as a decimal15,562.62

1,556,262% of 1001,556,262

1,556,262% of 1,00015,562,620

As a fraction of 1001,556,262/100

Read another way

As seconds18 days, 17 minutes and 42 seconds

As bytes1.484 MiB

As a 24-bit colour#17BF26

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.