Recognised as Number

1,557,488

Positive
Even
Composite
7 digits

1,557,488 is an even 7-digit integer and a composite number. It has 20 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,557,488

Digit count7

Digit sum38

Digit product44,800

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^4 × 311 × 313

Distinct prime factors32, 311, 313

Number of divisors20

Sum of divisors σ(n)3,037,008

Aliquot sum1,479,520sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)48,360the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 773,760

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 16, 311, 313, 622, 626, 1,244, 1,252, 2,488, 2,504, 4,976, 5,008, 97,343, 194,686, 389,372, 778,744, 1,557,48820 in total

Arithmetic

Previous number1,557,487

Next number1,557,489

Double3,114,976

Half778,744

Square2,425,768,870,144

Cube3,778,105,906,022,838,272

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

Cube root115.915515178≈

Negation-1,557,488

Reciprocal6.42059521 × 10^-7≈

Representations

Decimal1,557,488

Binary10111110000111111000021 bits

Octal5741760

Hexadecimal17C3F0

Base 36XDRK

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

In wordsone million, five hundred and fifty-seven thousand, four hundred and eighty-eight

Ordinalone million, five hundred and fifty-seven thousand, four hundred and eighty-eighth

Scientific notation1.557488 × 10^6

Engineering notation1.557488 × 10^6

In other bases

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

Quinary344314423base 5; one hand: 9 digits

Septenary16144532base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101111100001111110000

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 44 trailing zeros

Power of twoNo

Bytes317 c3 f0

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

At each machine width

32-bit00000000000101111100001111110000

64-bit0000000000000000000000000000000000000000000101111100001111110000

One's complement11111111111010000011110000001111at 32 bits, every bit flipped

Bits reversed00001111110000111110100000000000at 32 bits

Rotated left by 100000000001011111000011111100000at 32 bits, wrapping

Shifted left by 11011111000011111100000= 3,114,976, no wrap

Shifted right by 110111110000111111000= 778,744, discarding the low bit

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

Nearest landmarks

Next prime1,557,499+11

Previous prime1,557,481−7

Distance to nearest prime7

Nearest square below1,555,009

Nearest square above1,557,504

Powers & multiples

1,557,488 to the power 22,425,768,870,144

1,557,488 to the power 33,778,105,906,022,838,272

1,557,488 to the power 45,884,354,611,359,698,334,580,736

1,557,488 to the power 59,164,811,694,937,393,839,729,481,351,168

First ten multiples1,557,488, 3,114,976, 4,672,464, 6,229,952, 7,787,440, 9,344,928, 10,902,416, 12,459,904, 14,017,392, 15,574,880

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 3

Divisible by 6No, remainder 2

Divisible by 7No, remainder 2

Divisible by 8Yes

Divisible by 9No, remainder 2

Divisible by 10No, remainder 8

Divisible by 11No, remainder 9

Divisible by 12No, remainder 8

Divisible by 100No, remainder 88

Collatz (3n + 1) trajectory

Steps to reach 1155the total stopping time

Highest value reached2,217,6161× the starting value

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

First steps1,557,488 → 778,744 → 389,372 → 194,686 → 97,343 → 292,030 → 146,015 → 438,046 → 219,023 → 657,070 → …

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

As a percentage & fraction

As a percentage155,748,800%

1,557,488% as a decimal15,574.88

1,557,488% of 1001,557,488

1,557,488% of 1,00015,574,880

As a fraction of 1001,557,488/100

Read another way

As seconds18 days, 38 minutes and 8 seconds

As bytes1.485 MiB

As a 24-bit colour#17C3F0

Keep nerding

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