Recognised as Number

1,555,960

Positive
Even
Composite
7 digits

1,555,960 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,555,960

Digit count7

Digit sum31

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 numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 5 × 7 × 5,557

Distinct prime factors42, 5, 7, 5,557

Number of divisors32

Sum of divisors σ(n)4,001,760

Aliquot sum2,445,800sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)5,556the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 533,376

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 56, 70, 140, 280, 5,557, 11,114, 22,228, 27,785, 38,899, 44,456, 55,570, 77,798, 111,140, 155,596, 194,495, 222,280, 311,192, 388,990, 777,980, 1,555,96032 in total

Arithmetic

Previous number1,555,959

Next number1,555,961

Double3,111,920

Half777,980

Square2,421,011,521,600

Cube3,766,997,087,148,736,000

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

Cube root115.877595814≈

Negation-1,555,960

Reciprocal6.42690043 × 10^-7≈

Representations

Decimal1,555,960

Binary10111101111011111100021 bits

Octal5736770

Hexadecimal17BDF8

Base 36XCL4

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

In wordsone million, five hundred and fifty-five thousand, nine hundred and sixty

Ordinalone million, five hundred and fifty-five thousand, nine hundred and sixtieth

Scientific notation1.55596 × 10^6

Engineering notation1.55596 × 10^6

In other bases

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

Quinary344242320base 5; one hand: 9 digits

Septenary16140220base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101111011110111111000

Bit length21 bitsto write the magnitude

Set bits15the population count, or Hamming weight

Zero bits6within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 33 trailing zeros

Power of twoNo

Bytes317 bd f8

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

At each machine width

32-bit00000000000101111011110111111000

64-bit0000000000000000000000000000000000000000000101111011110111111000

One's complement11111111111010000100001000000111at 32 bits, every bit flipped

Bits reversed00011111101111011110100000000000at 32 bits

Rotated left by 100000000001011110111101111110000at 32 bits, wrapping

Shifted left by 11011110111101111110000= 3,111,920, no wrap

Shifted right by 110111101111011111100= 777,980, discarding the low bit

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

Nearest landmarks

Next prime1,555,963+3

Previous prime1,555,951−9

Distance to nearest prime3

Nearest square below1,555,009

Nearest square above1,557,504

Powers & multiples

1,555,960 to the power 22,421,011,521,600

1,555,960 to the power 33,766,997,087,148,736,000

1,555,960 to the power 45,861,296,787,719,947,266,560,000

1,555,960 to the power 59,119,943,349,820,729,148,876,697,600,000

First ten multiples1,555,960, 3,111,920, 4,667,880, 6,223,840, 7,779,800, 9,335,760, 10,891,720, 12,447,680, 14,003,640, 15,559,600

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5Yes

Divisible by 6No, remainder 4

Divisible by 7Yes

Divisible by 8Yes

Divisible by 9No, remainder 4

Divisible by 10Yes

Divisible by 11No, remainder 10

Divisible by 12No, remainder 4

Divisible by 100No, remainder 60

Collatz (3n + 1) trajectory

Steps to reach 1269the total stopping time

Highest value reached4,984,7203× the starting value

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

First steps1,555,960 → 777,980 → 388,990 → 194,495 → 583,486 → 291,743 → 875,230 → 437,615 → 1,312,846 → 656,423 → …

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

As a percentage & fraction

As a percentage155,596,000%

1,555,960% as a decimal15,559.6

1,555,960% of 1001,555,960

1,555,960% of 1,00015,559,600

As a fraction of 1001,555,960/100

Read another way

As seconds18 days, 12 minutes and 40 seconds

As bytes1.484 MiB

As a 24-bit colour#17BDF8

Keep nerding

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