Recognised as Number
59,472
- Positive
- Even
- Composite
- 5 digits
59,472 is an even 5-digit integer and a composite number. It has 60 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value59,472
Digit count5
Digit sum27
Digit product2,520
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^4 × 3^2 × 7 × 59
Distinct prime factors42, 3, 7, 59
Number of divisors60
Sum of divisors σ(n)193,440
Aliquot sum133,968sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)16,704integers below n that share no factor with it
Carmichael function λ(n)348the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 16,704
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 7, 8, 9, 12, 14, 16, 18, 21, 24, 28, 36, 42, 48, 56, 59, 63, 72, 84, 112, 118, 126, 144, 168, 177, 236, 252, 336, 354, 413, 472, 504, 531, 708, 826, 944, 1,008, 1,062, 1,239, 1,416, 1,652, 2,124, 2,478, 2,832, 3,304, 3,717, 4,248, 4,956, 6,608, 7,434, 8,496, 9,912, 14,868, 19,824, 29,736, 59,47260 in total
Arithmetic
Representations
Decimal59,472
Binary111010000101000016 bits
Octal164120
HexadecimalE850
Base 3619W0
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-nine thousand, four hundred and seventy-two
Ordinalfifty-nine thousand, four hundred and seventy-second
Scientific notation5.9472 × 10^4
Engineering notation59.472 × 10^3
In other bases
Ternary10000120200base 3; the most digit-efficient integer base after e: 11 digits
Quinary3400342base 5; one hand: 7 digits
Septenary335250base 7: 6 digits
Nonary100520base 9; each digit is two ternary digits: 6 digits
Duodecimal2a500base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal78dcbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal16:31:12base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10001TT1T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011100001010000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1110100001010000
Bit length16 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits10within that length
Bit parityeven6 set bits, so even; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes2e8 50
Gray code1001110001111000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1110100001010000
32-bit00000000000000001110100001010000
64-bit0000000000000000000000000000000000000000000000001110100001010000
One's complement0001011110101111at 16 bits, every bit flipped
Bits reversed0000101000010111at 16 bits
Rotated left by 11101000010100001at 16 bits, wrapping
Shifted left by 111101000010100000= 118,944, no wrap
Shifted right by 1111010000101000= 29,736, discarding the low bit
These bits as a double2.93830721 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
59,472 to the power 23,536,918,784
59,472 to the power 3210,347,633,922,048
59,472 to the power 412,509,794,484,612,038,656
59,472 to the power 5743,982,497,588,847,162,949,632
First ten multiples59,472, 118,944, 178,416, 237,888, 297,360, 356,832, 416,304, 475,776, 535,248, 594,720
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7Yes
Divisible by 8Yes
Divisible by 9Yes
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12Yes
Divisible by 100No, remainder 72
Collatz (3n + 1) trajectory
Steps to reach 1135the total stopping time
Highest value reached59,472
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps59,472 → 29,736 → 14,868 → 7,434 → 3,717 → 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,200%
59,472% as a decimal594.72
59,472% of 10059,472
59,472% of 1,000594,720
As a fraction of 10059,472/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 59,472
Nerdulate something else
Nothing in mind? Surprise me · today’s page