Recognised as Number
48,972
- Positive
- Even
- Composite
- 5 digits
48,972 is an even 5-digit integer and a composite number. It has 48 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value48,972
Digit count5
Digit sum30
Digit product4,032
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 numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 3 × 7 × 11 × 53
Distinct prime factors52, 3, 7, 11, 53
Number of divisors48
Sum of divisors σ(n)145,152
Aliquot sum96,180sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)12,480integers below n that share no factor with it
Carmichael function λ(n)780the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 12,480
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 7, 11, 12, 14, 21, 22, 28, 33, 42, 44, 53, 66, 77, 84, 106, 132, 154, 159, 212, 231, 308, 318, 371, 462, 583, 636, 742, 924, 1,113, 1,166, 1,484, 1,749, 2,226, 2,332, 3,498, 4,081, 4,452, 6,996, 8,162, 12,243, 16,324, 24,486, 48,97248 in total
Arithmetic
Representations
Decimal48,972
Binary101111110100110016 bits
Octal137514
HexadecimalBF4C
Base 3611SC
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-eight thousand, nine hundred and seventy-two
Ordinalforty-eight thousand, nine hundred and seventy-second
Scientific notation4.8972 × 10^4
Engineering notation48.972 × 10^3
In other bases
Ternary2111011210base 3; the most digit-efficient integer base after e: 10 digits
Quinary3031342base 5; one hand: 7 digits
Septenary262530base 7: 6 digits
Nonary74153base 9; each digit is two ternary digits: 5 digits
Duodecimal24410base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal628cbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal13:36:12base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T1111TTT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100001101011100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1011111101001100
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 even
Highest set bitbit 15worth 32,768
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes2bf 4c
Gray code1110000011101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1011111101001100
32-bit00000000000000001011111101001100
64-bit0000000000000000000000000000000000000000000000001011111101001100
One's complement0100000010110011at 16 bits, every bit flipped
Bits reversed0011001011111101at 16 bits
Rotated left by 10111111010011001at 16 bits, wrapping
Shifted left by 110111111010011000= 97,944, no wrap
Shifted right by 1101111110100110= 24,486, discarding the low bit
These bits as a double2.41953828 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
48,972 to the power 22,398,256,784
48,972 to the power 3117,447,431,226,048
48,972 to the power 45,751,635,602,002,022,656
48,972 to the power 5281,669,098,701,243,053,509,632
First ten multiples48,972, 97,944, 146,916, 195,888, 244,860, 293,832, 342,804, 391,776, 440,748, 489,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 8No, remainder 4
Divisible by 9No, remainder 3
Divisible by 10No, remainder 2
Divisible by 11Yes
Divisible by 12Yes
Divisible by 100No, remainder 72
Collatz (3n + 1) trajectory
Steps to reach 1176the total stopping time
Highest value reached8,153,620166× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps48,972 → 24,486 → 12,243 → 36,730 → 18,365 → 55,096 → 27,548 → 13,774 → 6,887 → 20,662 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage4,897,200%
48,972% as a decimal489.72
48,972% of 10048,972
48,972% of 1,000489,720
As a fraction of 10048,972/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 48,972
Nerdulate something else
Nothing in mind? Surprise me · today’s page