Recognised as Number
48,930
- Positive
- Even
- Composite
- 5 digits
48,930 is an even 5-digit integer and a composite number. It has 32 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value48,930
Digit count5
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 5 × 7 × 233
Distinct prime factors52, 3, 5, 7, 233
Number of divisors32
Sum of divisors σ(n)134,784
Aliquot sum85,854sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)11,136integers below n that share no factor with it
Carmichael function λ(n)696the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 11,136
Möbius function μ(n)−15 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 105, 210, 233, 466, 699, 1,165, 1,398, 1,631, 2,330, 3,262, 3,495, 4,893, 6,990, 8,155, 9,786, 16,310, 24,465, 48,93032 in total
Arithmetic
Representations
Decimal48,930
Binary101111110010001016 bits
Octal137442
HexadecimalBF22
Base 3611R6
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-eight thousand, nine hundred and thirty
Ordinalforty-eight thousand, nine hundred and thirtieth
Scientific notation4.893 × 10^4
Engineering notation48.93 × 10^3
In other bases
Ternary2111010020base 3; the most digit-efficient integer base after e: 10 digits
Quinary3031210base 5; one hand: 7 digits
Septenary262440base 7: 6 digits
Nonary74106base 9; each digit is two ternary digits: 5 digits
Duodecimal24396base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal626abase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal13:35:30base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T1110101T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100001101100110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1011111100100010
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 11 trailing zero
Power of twoNo
Bytes2bf 22
Gray code1110000010110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1011111100100010
32-bit00000000000000001011111100100010
64-bit0000000000000000000000000000000000000000000000001011111100100010
One's complement0100000011011101at 16 bits, every bit flipped
Bits reversed0100010011111101at 16 bits
Rotated left by 10111111001000101at 16 bits, wrapping
Shifted left by 110111111001000100= 97,860, no wrap
Shifted right by 1101111110010001= 24,465, discarding the low bit
These bits as a double2.41746321 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
48,930 to the power 22,394,144,900
48,930 to the power 3117,145,509,957,000
48,930 to the power 45,731,929,802,196,010,000
48,930 to the power 5280,463,325,221,450,769,300,000
First ten multiples48,930, 97,860, 146,790, 195,720, 244,650, 293,580, 342,510, 391,440, 440,370, 489,300
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7Yes
Divisible by 8No, remainder 2
Divisible by 9No, remainder 6
Divisible by 10Yes
Divisible by 11No, remainder 2
Divisible by 12No, remainder 6
Divisible by 100No, remainder 30
Collatz (3n + 1) trajectory
Steps to reach 1127the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps48,930 → 24,465 → 73,396 → 36,698 → 18,349 → 55,048 → 27,524 → 13,762 → 6,881 → 20,644 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage4,893,000%
48,930% as a decimal489.3
48,930% of 10048,930
48,930% of 1,000489,300
As a fraction of 10048,930/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,930
Nerdulate something else
Nothing in mind? Surprise me · today’s page