Recognised as Number

5,478,564

Positive
Even
Composite
7 digits

5,478,564 is an even 7-digit integer and a composite number. It has 96 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value5,478,564

Digit count7

Digit sum39

Digit product134,400

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 3 × 7 × 13 × 29 × 173

Distinct prime factors62, 3, 7, 13, 29, 173

Number of divisors96

Sum of divisors σ(n)16,369,920

Aliquot sum10,891,356sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)1,387,008integers below n that share no factor with it

Carmichael function λ(n)3,612the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,387,008

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 7, 12, 13, 14, 21, 26, 28, 29, 39, 42, 52, 58, 78, 84, 87, 91, 116, 156, 173, 174, 182, 203, 273, 346, 348, 364, 377, 406, 519, 546, 609, 692, 754, 812, 1,038, 1,092, 1,131, 1,211, 1,218, 1,508, 2,076, 2,249, 2,262, 2,422, 2,436, 2,639, 3,633, 4,498, 4,524, 4,844, 5,017, 5,278, 6,747, 7,266, 7,917, 8,996, 10,034, 10,556, 13,494, 14,532, 15,051, 15,743, 15,834, 20,068, 26,988, 30,102, 31,486, 31,668, 35,119, 47,229, 60,204, 62,972, 65,221, 70,238, 94,458, 105,357, 130,442, 140,476, 188,916, 195,663, 210,714, 260,884, 391,326, 421,428, 456,547, 782,652, 913,094, 1,369,641, 1,826,188, 2,739,282, 5,478,56496 in total

Arithmetic

Previous number5,478,563

Next number5,478,565

Double10,957,128

Half2,739,282

Square30,014,663,502,096

Cube164,437,254,934,697,070,144

Square root2,340.633247649≈irrational, shown to 9 decimal places

Cube root176.287795325≈

Negation-5,478,564

Reciprocal1.82529583 × 10^-7≈

Representations

Decimal5,478,564

Binary1010011100110001010010023 bits

Octal24714244

Hexadecimal5398A4

Base 3639FAC

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

In wordsfive million, four hundred and seventy-eight thousand, five hundred and sixty-four

Ordinalfive million, four hundred and seventy-eight thousand, five hundred and sixty-fourth

Scientific notation5.478564 × 10^6

Engineering notation5.478564 × 10^6

In other bases

Ternary101022100011210base 3; the most digit-efficient integer base after e: 15 digits

Quinary2400303224base 5; one hand: 10 digits

Septenary64365330base 7: 8 digits

Nonary11270153base 9; each digit is two ternary digits: 8 digits

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

Vigesimal1e4g84base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal25:21:49:24base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000010100111001100010100100

Bit length23 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits13within that length

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

Highest set bitbit 22worth 4,194,304

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes353 98 a4

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

At each machine width

32-bit00000000010100111001100010100100

64-bit0000000000000000000000000000000000000000010100111001100010100100

One's complement11111111101011000110011101011011at 32 bits, every bit flipped

Bits reversed00100101000110011100101000000000at 32 bits

Rotated left by 100000000101001110011000101001000at 32 bits, wrapping

Shifted left by 1101001110011000101001000= 10,957,128, no wrap

Shifted right by 11010011100110001010010= 2,739,282, discarding the low bit

These bits as a double2.70677026 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime5,478,569+5

Previous prime5,478,559−5

Distance to nearest prime5

Nearest square below5,475,600

Nearest square above5,480,281

Powers & multiples

5,478,564 to the power 230,014,663,502,096

5,478,564 to the power 3164,437,254,934,697,070,144

5,478,564 to the power 4900,880,025,144,053,719,396,393,216

5,478,564 to the power 54,935,528,874,073,307,521,151,181,603,021,824

First ten multiples5,478,564, 10,957,128, 16,435,692, 21,914,256, 27,392,820, 32,871,384, 38,349,948, 43,828,512, 49,307,076, 54,785,640

Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4Yes

Divisible by 5No, remainder 4

Divisible by 6Yes

Divisible by 7Yes

Divisible by 8No, remainder 4

Divisible by 9No, remainder 3

Divisible by 10No, remainder 4

Divisible by 11No, remainder 3

Divisible by 12Yes

Divisible by 100No, remainder 64

Collatz (3n + 1) trajectory

Steps to reach 1170the total stopping time

Highest value reached44,426,5368× the starting value

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

First steps5,478,564 → 2,739,282 → 1,369,641 → 4,108,924 → 2,054,462 → 1,027,231 → 3,081,694 → 1,540,847 → 4,622,542 → 2,311,271 → …

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

As a percentage & fraction

As a percentage547,856,400%

5,478,564% as a decimal54,785.64

5,478,564% of 1005,478,564

5,478,564% of 1,00054,785,640

As a fraction of 1005,478,564/100

Read another way

As seconds63 days, 9 hours and 49 minutes

As bytes5.225 MiB

As a 24-bit colour#5398A4

Keep nerding

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