Recognised as Number

48,461

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value48,461

Digit count5

Digit sum23

Digit product768

Multiplicative persistence5times 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 numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation7^2 × 23 × 43

Distinct prime factors37, 23, 43

Number of divisors12

Sum of divisors σ(n)60,192

Aliquot sum11,731sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)462the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 38,808

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 7, 23, 43, 49, 161, 301, 989, 1,127, 2,107, 6,923, 48,46112 in total

Arithmetic

Previous number48,460

Next number48,462

Double96,922

Half24,230.5

Square2,348,468,521

Cube113,809,132,996,181

Square root220.138592709≈irrational, shown to 9 decimal places

Cube root36.458387555≈

Negation-48,461

Reciprocal0.0000206351≈

Representations

Decimal48,461

Binary101111010100110116 bits

Octal136515

HexadecimalBD4D

Base 3611E5

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

In wordsforty-eight thousand, four hundred and sixty-one

Ordinalforty-eight thousand, four hundred and sixty-first

Scientific notation4.8461 × 10^4

Engineering notation48.461 × 10^3

In other bases

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

Quinary3022321base 5; one hand: 7 digits

Septenary261200base 7: 6 digits

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

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

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

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

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

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

Bit-level

1011110101001101

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

Bytes2bd 4d

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

At each machine width

16-bit1011110101001101

32-bit00000000000000001011110101001101

64-bit0000000000000000000000000000000000000000000000001011110101001101

One's complement0100001010110010at 16 bits, every bit flipped

Bits reversed1011001010111101at 16 bits

Rotated left by 10111101010011011at 16 bits, wrapping

Shifted left by 110111101010011010= 96,922, no wrap

Shifted right by 1101111010100110= 24,230, discarding the low bit

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

Nearest landmarks

Next prime48,463+2

Previous prime48,449−12

Distance to nearest prime2

Nearest square below48,400

Nearest square above48,841

Powers & multiples

48,461 to the power 22,348,468,521

48,461 to the power 3113,809,132,996,181

48,461 to the power 45,515,304,394,127,927,441

48,461 to the power 5267,277,166,243,833,491,718,301

First ten multiples48,461, 96,922, 145,383, 193,844, 242,305, 290,766, 339,227, 387,688, 436,149, 484,610

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 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 5

Divisible by 10No, remainder 1

Divisible by 11No, remainder 6

Divisible by 12No, remainder 5

Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 1189the total stopping time

Highest value reached1,276,93626× the starting value

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

First steps48,461 → 145,384 → 72,692 → 36,346 → 18,173 → 54,520 → 27,260 → 13,630 → 6,815 → 20,446 → …

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

As a percentage & fraction

As a percentage4,846,100%

48,461% as a decimal484.61

48,461% of 10048,461

48,461% of 1,000484,610

As a fraction of 10048,461/100

Read another way

As seconds13 hours, 27 minutes and 41 seconds

As bytes47.325 KiB

As a 24-bit colour#00BD4D

Keep nerding

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