Recognised as Number
48,608
- Positive
- Even
- Composite
- 5 digits
48,608 is an even 5-digit integer and a composite number. It has 36 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value48,608
Digit count5
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^5 × 7^2 × 31
Distinct prime factors32, 7, 31
Number of divisors36
Sum of divisors σ(n)114,912
Aliquot sum66,304sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)20,160integers below n that share no factor with it
Carmichael function λ(n)840the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 20,160
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 7, 8, 14, 16, 28, 31, 32, 49, 56, 62, 98, 112, 124, 196, 217, 224, 248, 392, 434, 496, 784, 868, 992, 1,519, 1,568, 1,736, 3,038, 3,472, 6,076, 6,944, 12,152, 24,304, 48,60836 in total
Arithmetic
Representations
Decimal48,608
Binary101111011110000016 bits
Octal136740
HexadecimalBDE0
Base 3611I8
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-eight thousand, six hundred and eight
Ordinalforty-eight thousand, six hundred and eighth
Scientific notation4.8608 × 10^4
Engineering notation48.608 × 10^3
In other bases
Ternary2110200022base 3; the most digit-efficient integer base after e: 10 digits
Quinary3023413base 5; one hand: 7 digits
Septenary261500base 7: 6 digits
Nonary73608base 9; each digit is two ternary digits: 5 digits
Duodecimal24168base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal61a8base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal13:30:8base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T111T0010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100001000100000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1011110111100000
Bit length16 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits7within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 55 trailing zeros
Power of twoNo
Bytes2bd e0
Gray code1110001100010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1011110111100000
32-bit00000000000000001011110111100000
64-bit0000000000000000000000000000000000000000000000001011110111100000
One's complement0100001000011111at 16 bits, every bit flipped
Bits reversed0000011110111101at 16 bits
Rotated left by 10111101111000001at 16 bits, wrapping
Shifted left by 110111101111000000= 97,216, no wrap
Shifted right by 1101111011110000= 24,304, discarding the low bit
These bits as a double2.40155429 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
48,608 to the power 22,362,737,664
48,608 to the power 3114,847,952,371,712
48,608 to the power 45,582,529,268,884,176,896
48,608 to the power 5271,355,582,701,922,070,560,768
First ten multiples48,608, 97,216, 145,824, 194,432, 243,040, 291,648, 340,256, 388,864, 437,472, 486,080
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8Yes
Divisible by 9No, remainder 8
Divisible by 10No, remainder 8
Divisible by 11No, remainder 10
Divisible by 12No, remainder 8
Divisible by 100No, remainder 8
Collatz (3n + 1) trajectory
Steps to reach 1158the total stopping time
Highest value reached48,608
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps48,608 → 24,304 → 12,152 → 6,076 → 3,038 → 1,519 → 4,558 → 2,279 → 6,838 → 3,419 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage4,860,800%
48,608% as a decimal486.08
48,608% of 10048,608
48,608% of 1,000486,080
As a fraction of 10048,608/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,608
Nerdulate something else
Nothing in mind? Surprise me · today’s page