Recognised as Number

59,476

Positive
Even
Composite
5 digits

59,476 is an even 5-digit integer and a composite number. It has 6 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value59,476

Digit count5

Digit sum31

Digit product7,560

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 14,869

Distinct prime factors22, 14,869

Number of divisors6

Sum of divisors σ(n)104,090

Aliquot sum44,614sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)14,868the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 29,736

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 14,869, 29,738, 59,4766 in total

Arithmetic

Previous number59,475

Next number59,477

Double118,952

Half29,738

Square3,537,394,576

Cube210,390,079,802,176

Square root243.877018187≈irrational, shown to 9 decimal places

Cube root39.034376878≈

Negation-59,476

Reciprocal0.0000168135≈

Representations

Decimal59,476

Binary111010000101010016 bits

Octal164124

HexadecimalE854

Base 3619W4

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

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

Ordinalfifty-nine thousand, four hundred and seventy-sixth

Scientific notation5.9476 × 10^4

Engineering notation59.476 × 10^3

In other bases

Ternary10000120211base 3; the most digit-efficient integer base after e: 11 digits

Quinary3400401base 5; one hand: 7 digits

Septenary335254base 7: 6 digits

Nonary100524base 9; each digit is two ternary digits: 6 digits

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

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

Sexagesimal16:31:16base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1110100001010100

Bit length16 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits9within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes2e8 54

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

At each machine width

16-bit1110100001010100

32-bit00000000000000001110100001010100

64-bit0000000000000000000000000000000000000000000000001110100001010100

One's complement0001011110101011at 16 bits, every bit flipped

Bits reversed0010101000010111at 16 bits

Rotated left by 11101000010101001at 16 bits, wrapping

Shifted left by 111101000010101000= 118,952, no wrap

Shifted right by 1111010000101010= 29,738, discarding the low bit

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

Nearest landmarks

Next prime59,497+21

Previous prime59,473−3

Distance to nearest prime3

Nearest square below59,049

Nearest square above59,536

Powers & multiples

59,476 to the power 23,537,394,576

59,476 to the power 3210,390,079,802,176

59,476 to the power 412,513,160,386,314,219,776

59,476 to the power 5744,232,727,136,424,535,397,376

First ten multiples59,476, 118,952, 178,428, 237,904, 297,380, 356,856, 416,332, 475,808, 535,284, 594,760

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

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 7No, remainder 4

Divisible by 8No, remainder 4

Divisible by 9No, remainder 4

Divisible by 10No, remainder 6

Divisible by 11No, remainder 10

Divisible by 12No, remainder 4

Divisible by 100No, remainder 76

Collatz (3n + 1) trajectory

Steps to reach 1135the total stopping time

Highest value reached59,476

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

First steps59,476 → 29,738 → 14,869 → 44,608 → 22,304 → 11,152 → 5,576 → 2,788 → 1,394 → 697 → …

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

As a percentage & fraction

As a percentage5,947,600%

59,476% as a decimal594.76

59,476% of 10059,476

59,476% of 1,000594,760

As a fraction of 10059,476/100

Read another way

As seconds16 hours, 31 minutes and 16 seconds

As bytes58.082 KiB

As a 24-bit colour#00E854

Keep nerding

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