Recognised as Number

54,479

Positive
Odd
Composite
5 digits

54,479 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value54,479

Digit count5

Digit sum29

Digit product5,040

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 factorisation157 × 347

Distinct prime factors2157, 347

Number of divisors4

Sum of divisors σ(n)54,984

Aliquot sum505sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)26,988the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 53,976

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 157, 347, 54,4794 in total

Arithmetic

Previous number54,478

Next number54,480

Double108,958

Half27,239.5

Square2,967,961,441

Cube161,691,571,344,239

Square root233.407369207≈irrational, shown to 9 decimal places

Cube root37.909062329≈

Negation-54,479

Reciprocal0.0000183557≈

Representations

Decimal54,479

Binary110101001100111116 bits

Octal152317

HexadecimalD4CF

Base 36161B

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

In wordsfifty-four thousand, four hundred and seventy-nine

Ordinalfifty-four thousand, four hundred and seventy-ninth

Scientific notation5.4479 × 10^4

Engineering notation54.479 × 10^3

In other bases

Ternary2202201202base 3; the most digit-efficient integer base after e: 10 digits

Quinary3220404base 5; one hand: 7 digits

Septenary314555base 7: 6 digits

Nonary82652base 9; each digit is two ternary digits: 5 digits

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

Vigesimal6g3jbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal15:7:59base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1101010011001111

Bit length16 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits6within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2d4 cf

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

At each machine width

16-bit1101010011001111

32-bit00000000000000001101010011001111

64-bit0000000000000000000000000000000000000000000000001101010011001111

One's complement0010101100110000at 16 bits, every bit flipped

Bits reversed1111001100101011at 16 bits

Rotated left by 11010100110011111at 16 bits, wrapping

Shifted left by 111010100110011110= 108,958, no wrap

Shifted right by 1110101001100111= 27,239, discarding the low bit

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

Nearest landmarks

Next prime54,493+14

Previous prime54,469−10

Distance to nearest prime10

Nearest square below54,289

Nearest square above54,756

Powers & multiples

54,479 to the power 22,967,961,441

54,479 to the power 3161,691,571,344,239

54,479 to the power 48,808,795,115,262,796,481

54,479 to the power 5479,894,349,084,401,889,488,399

First ten multiples54,479, 108,958, 163,437, 217,916, 272,395, 326,874, 381,353, 435,832, 490,311, 544,790

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 5

Divisible by 8No, remainder 7

Divisible by 9No, remainder 2

Divisible by 10No, remainder 9

Divisible by 11No, remainder 7

Divisible by 12No, remainder 11

Divisible by 100No, remainder 79

Collatz (3n + 1) trajectory

Steps to reach 196the total stopping time

Highest value reached551,60810× the starting value

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

First steps54,479 → 163,438 → 81,719 → 245,158 → 122,579 → 367,738 → 183,869 → 551,608 → 275,804 → 137,902 → …

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

As a percentage & fraction

As a percentage5,447,900%

54,479% as a decimal544.79

54,479% of 10054,479

54,479% of 1,000544,790

As a fraction of 10054,479/100

Read another way

As seconds15 hours, 7 minutes and 59 seconds

As bytes53.202 KiB

As a 24-bit colour#00D4CF

Keep nerding

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