Recognised as Number

48,262

Positive
Even
Composite
5 digits

48,262 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value48,262

Digit count5

Digit sum22

Digit product768

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 59 × 409

Distinct prime factors32, 59, 409

Number of divisors8

Sum of divisors σ(n)73,800

Aliquot sum25,538sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)11,832the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 23,664

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 59, 118, 409, 818, 24,131, 48,2628 in total

Arithmetic

Previous number48,261

Next number48,263

Double96,524

Half24,131

Square2,329,220,644

Cube112,412,846,720,728

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

Cube root36.408414912≈

Negation-48,262

Reciprocal0.0000207202≈

Representations

Decimal48,262

Binary101111001000011016 bits

Octal136206

HexadecimalBC86

Base 36118M

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

In wordsforty-eight thousand, two hundred and sixty-two

Ordinalforty-eight thousand, two hundred and sixty-second

Scientific notation4.8262 × 10^4

Engineering notation48.262 × 10^3

In other bases

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

Quinary3021022base 5; one hand: 7 digits

Septenary260464base 7: 6 digits

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

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

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

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

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

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

Bit-level

1011110010000110

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

Bit parityeven8 set bits, so even; not the same as the number itself being even

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes2bc 86

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

At each machine width

16-bit1011110010000110

32-bit00000000000000001011110010000110

64-bit0000000000000000000000000000000000000000000000001011110010000110

One's complement0100001101111001at 16 bits, every bit flipped

Bits reversed0110000100111101at 16 bits

Rotated left by 10111100100001101at 16 bits, wrapping

Shifted left by 110111100100001100= 96,524, no wrap

Shifted right by 1101111001000011= 24,131, discarding the low bit

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

Nearest landmarks

Next prime48,271+9

Previous prime48,259−3

Distance to nearest prime3

Nearest square below47,961

Nearest square above48,400

Powers & multiples

48,262 to the power 22,329,220,644

48,262 to the power 3112,412,846,720,728

48,262 to the power 45,425,268,808,435,774,736

48,262 to the power 5261,834,323,232,727,360,308,832

First ten multiples48,262, 96,524, 144,786, 193,048, 241,310, 289,572, 337,834, 386,096, 434,358, 482,620

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6No, remainder 4

Divisible by 7No, remainder 4

Divisible by 8No, remainder 6

Divisible by 9No, remainder 4

Divisible by 10No, remainder 2

Divisible by 11No, remainder 5

Divisible by 12No, remainder 10

Divisible by 100No, remainder 62

Collatz (3n + 1) trajectory

Steps to reach 152the total stopping time

Highest value reached108,5922× the starting value

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

First steps48,262 → 24,131 → 72,394 → 36,197 → 108,592 → 54,296 → 27,148 → 13,574 → 6,787 → 20,362 → …

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

As a percentage & fraction

As a percentage4,826,200%

48,262% as a decimal482.62

48,262% of 10048,262

48,262% of 1,000482,620

As a fraction of 10048,262/100

Read another way

As seconds13 hours, 24 minutes and 22 seconds

As bytes47.131 KiB

As a 24-bit colour#00BC86

Keep nerding

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