Recognised as Number

1,552,516

Positive
Even
Composite
Perfect square
7 digits

1,552,516 is an even 7-digit integer and a composite number. It has 27 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,552,516

Digit count7

Digit sum25

Digit product1,500

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Perfect squareYes, 1,246²

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 7^2 × 89^2

Distinct prime factors32, 7, 89

Number of divisors27

Sum of divisors σ(n)3,196,389

Aliquot sum1,643,873sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)164,472the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 657,888

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 7, 14, 28, 49, 89, 98, 178, 196, 356, 623, 1,246, 2,492, 4,361, 7,921, 8,722, 15,842, 17,444, 31,684, 55,447, 110,894, 221,788, 388,129, 776,258, 1,552,51627 in total

Arithmetic

Previous number1,552,515

Next number1,552,517

Double3,105,032

Half776,258

Square2,410,305,930,256

Cube3,742,038,521,617,324,096

Square root1,246exact

Cube root115.79203722≈

Negation-1,552,516

Reciprocal6.44115745 × 10^-7≈

Representations

Decimal1,552,516

Binary10111101100001000010021 bits

Octal5730204

Hexadecimal17B084

Base 36X9XG

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

In wordsone million, five hundred and fifty-two thousand, five hundred and sixteen

Ordinalone million, five hundred and fifty-two thousand, five hundred and sixteenth

Scientific notation1.552516 × 10^6

Engineering notation1.552516 × 10^6

In other bases

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

Quinary344140031base 5; one hand: 9 digits

Septenary16124200base 7: 8 digits

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

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

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

Sexagesimal7:11:15:16base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101111011000010000100

Bit length21 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits12within that length

Bit parityodd9 set bits, so odd; 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 b0 84

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

At each machine width

32-bit00000000000101111011000010000100

64-bit0000000000000000000000000000000000000000000101111011000010000100

One's complement11111111111010000100111101111011at 32 bits, every bit flipped

Bits reversed00100001000011011110100000000000at 32 bits

Rotated left by 100000000001011110110000100001000at 32 bits, wrapping

Shifted left by 11011110110000100001000= 3,105,032, no wrap

Shifted right by 110111101100001000010= 776,258, discarding the low bit

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

Nearest landmarks

Next prime1,552,517+1

Previous prime1,552,513−3

Distance to nearest prime1

Nearest square below1,552,516

Nearest square above1,555,009

Powers & multiples

1,552,516 to the power 22,410,305,930,256

1,552,516 to the power 33,742,038,521,617,324,096

1,552,516 to the power 45,809,574,677,427,241,536,225,536

1,552,516 to the power 59,019,457,639,900,631,320,854,724,248,576

First ten multiples1,552,516, 3,105,032, 4,657,548, 6,210,064, 7,762,580, 9,315,096, 10,867,612, 12,420,128, 13,972,644, 15,525,160

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 5No, remainder 1

Divisible by 6No, remainder 4

Divisible by 7Yes

Divisible by 8No, remainder 4

Divisible by 9No, remainder 7

Divisible by 10No, remainder 6

Divisible by 11No, remainder 9

Divisible by 12No, remainder 4

Divisible by 100No, remainder 16

Collatz (3n + 1) trajectory

Steps to reach 188the total stopping time

Highest value reached1,552,516

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

First steps1,552,516 → 776,258 → 388,129 → 1,164,388 → 582,194 → 291,097 → 873,292 → 436,646 → 218,323 → 654,970 → …

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

As a percentage & fraction

As a percentage155,251,600%

1,552,516% as a decimal15,525.16

1,552,516% of 1001,552,516

1,552,516% of 1,00015,525,160

As a fraction of 1001,552,516/100

Read another way

As seconds17 days, 23 hours and 15 minutes

As bytes1.481 MiB

As a 24-bit colour#17B084

Keep nerding

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