Nerdulator> put something in

Recognised as Number

48,479

  • Positive
  • Odd
  • Prime
  • 5 digits

48,479 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value48,479
Digit count5
Digit sum32
Digit product8,064
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation48,479
Distinct prime factors148,479
Number of divisors2
Sum of divisors σ(n)48,480
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)48,478integers below n that share no factor with it
Carmichael function λ(n)48,478the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 48,4792 in total

Arithmetic

Previous number48,478
Next number48,480
Double96,958
Square root220.179472249≈irrational, shown to 9 decimal places
Cube root36.462900942≈
Negation-48,479
Reciprocal0.0000206275≈

Representations

Decimal48,479
Binary101111010101111116 bits
Octal136537
HexadecimalBD5F
Base 3611EN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-eight thousand, four hundred and seventy-nine
Ordinalforty-eight thousand, four hundred and seventy-ninth
Scientific notation4.8479 × 10^4
Engineering notation48.479 × 10^3

In other bases

Ternary2110111112base 3; the most digit-efficient integer base after e: 10 digits
Quinary3022404base 5; one hand: 7 digits
Septenary261224base 7: 6 digits
Nonary73445base 9; each digit is two ternary digits: 5 digits
Duodecimal2407bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal613jbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal13:27:59base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T111TTTTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100001010100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1011110101011111
Bit length16 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits4within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2bd 5f
Gray code1110001111110000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1011110101011111
32-bit00000000000000001011110101011111
64-bit0000000000000000000000000000000000000000000000001011110101011111
One's complement0100001010100000at 16 bits, every bit flipped
Bits reversed1111101010111101at 16 bits
Rotated left by 10111101010111111at 16 bits, wrapping
Shifted left by 110111101010111110= 96,958, no wrap
Shifted right by 1101111010101111= 24,239, discarding the low bit
These bits as a double2.39518084 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime48,481+2
Previous prime48,473−6
Distance to nearest prime0, it is prime
Nearest square below48,400
Nearest square above48,841

Powers & multiples

48,479 to the power 22,350,213,441
48,479 to the power 3113,935,997,406,239
48,479 to the power 45,523,503,218,257,060,481
48,479 to the power 5267,773,912,517,884,035,058,399
First ten multiples48,479, 96,958, 145,437, 193,916, 242,395, 290,874, 339,353, 387,832, 436,311, 484,790
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 79

Collatz (3n + 1) trajectory

Steps to reach 1189the total stopping time
Highest value reached6,810,136140× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps48,479 → 145,438 → 72,719 → 218,158 → 109,079 → 327,238 → 163,619 → 490,858 → 245,429 → 736,288 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,847,900%
48,479% as a decimal484.79
48,479% of 10048,479
48,479% of 1,000484,790
As a fraction of 10048,479/100

Read another way

As bytes47.343 KiB
As a 24-bit colour#00BD5F

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “48479” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.