Recognised as Number

48,207

Positive
Odd
Composite
5 digits

48,207 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value48,207

Digit count5

Digit sum21

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 16,069

Distinct prime factors23, 16,069

Number of divisors4

Sum of divisors σ(n)64,280

Aliquot sum16,073sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)32,136integers below n that share no factor with it

Carmichael function λ(n)16,068the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 32,136

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 16,069, 48,2074 in total

Arithmetic

Previous number48,206

Next number48,208

Double96,414

Half24,103.5

Square2,323,914,849

Cube112,028,963,125,743

Square root219.560925485≈irrational, shown to 9 decimal places

Cube root36.394579155≈

Negation-48,207

Reciprocal0.0000207439≈

Representations

Decimal48,207

Binary101111000100111116 bits

Octal136117

HexadecimalBC4F

Base 361173

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsforty-eight thousand, two hundred and seven

Ordinalforty-eight thousand, two hundred and seventh

Scientific notation4.8207 × 10^4

Engineering notation48.207 × 10^3

In other bases

Ternary2110010110base 3; the most digit-efficient integer base after e: 10 digits

Quinary3020312base 5; one hand: 7 digits

Septenary260355base 7: 6 digits

Nonary73113base 9; each digit is two ternary digits: 5 digits

Duodecimal23a93base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal60a7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal13:23:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1T110010110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11100110001010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1011110001001111

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 odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2bc 4f

Gray code1110001001101000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1011110001001111

32-bit00000000000000001011110001001111

64-bit0000000000000000000000000000000000000000000000001011110001001111

One's complement0100001110110000at 16 bits, every bit flipped

Bits reversed1111001000111101at 16 bits

Rotated left by 10111100010011111at 16 bits, wrapping

Shifted left by 110111100010011110= 96,414, no wrap

Shifted right by 1101111000100111= 24,103, discarding the low bit

These bits as a double2.38174226 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime48,221+14

Previous prime48,197−10

Distance to nearest prime10

Nearest square below47,961

Nearest square above48,400

Powers & multiples

48,207 to the power 22,323,914,849

48,207 to the power 3112,028,963,125,743

48,207 to the power 45,400,580,225,402,692,801

48,207 to the power 5260,345,770,925,987,611,857,807

First ten multiples48,207, 96,414, 144,621, 192,828, 241,035, 289,242, 337,449, 385,656, 433,863, 482,070

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 7

Divisible by 9No, remainder 3

Divisible by 10No, remainder 7

Divisible by 11No, remainder 5

Divisible by 12No, remainder 3

Divisible by 100No, remainder 7

Collatz (3n + 1) trajectory

Steps to reach 144the total stopping time

Highest value reached488,10410× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps48,207 → 144,622 → 72,311 → 216,934 → 108,467 → 325,402 → 162,701 → 488,104 → 244,052 → 122,026 → …

Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,820,700%

48,207% as a decimal482.07

48,207% of 10048,207

48,207% of 1,000482,070

As a fraction of 10048,207/100

Read another way

As seconds13 hours, 23 minutes and 27 seconds

As bytes47.077 KiB

As a 24-bit colour#00BC4F

Keep nerding

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