Recognised as Number

48,463

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value48,463

Digit count5

Digit sum25

Digit product2,304

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation48,463

Distinct prime factors148,463

Number of divisors2

Sum of divisors σ(n)48,464

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)48,462the 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,4632 in total

Arithmetic

Previous number48,462

Next number48,464

Double96,926

Half24,231.5

Square2,348,662,369

Cube113,823,224,388,847

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

Cube root36.458889098≈

Negation-48,463

Reciprocal0.0000206343≈

Representations

Decimal48,463

Binary101111010100111116 bits

Octal136517

HexadecimalBD4F

Base 3611E7

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

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

Ordinalforty-eight thousand, four hundred and sixty-third

Scientific notation4.8463 × 10^4

Engineering notation48.463 × 10^3

In other bases

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

Quinary3022323base 5; one hand: 7 digits

Septenary261202base 7: 6 digits

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

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

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

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

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

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

Bit-level

1011110101001111

Bit length16 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits5within that length

Bit parityodd11 set bits, so odd; 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 4f

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

At each machine width

16-bit1011110101001111

32-bit00000000000000001011110101001111

64-bit0000000000000000000000000000000000000000000000001011110101001111

One's complement0100001010110000at 16 bits, every bit flipped

Bits reversed1111001010111101at 16 bits

Rotated left by 10111101010011111at 16 bits, wrapping

Shifted left by 110111101010011110= 96,926, no wrap

Shifted right by 1101111010100111= 24,231, discarding the low bit

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

Nearest landmarks

Next prime48,473+10

Previous prime48,449−14

Distance to nearest prime0, it is prime

Nearest square below48,400

Nearest square above48,841

Powers & multiples

48,463 to the power 22,348,662,369

48,463 to the power 3113,823,224,388,847

48,463 to the power 45,516,214,923,556,692,161

48,463 to the power 5267,332,323,840,327,972,198,543

First ten multiples48,463, 96,926, 145,389, 193,852, 242,315, 290,778, 339,241, 387,704, 436,167, 484,630

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 7

Divisible by 9No, remainder 7

Divisible by 10No, remainder 3

Divisible by 11No, remainder 8

Divisible by 12No, remainder 7

Divisible by 100No, remainder 63

Collatz (3n + 1) trajectory

Steps to reach 170the total stopping time

Highest value reached490,69610× the starting value

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

First steps48,463 → 145,390 → 72,695 → 218,086 → 109,043 → 327,130 → 163,565 → 490,696 → 245,348 → 122,674 → …

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

As a percentage & fraction

As a percentage4,846,300%

48,463% as a decimal484.63

48,463% of 10048,463

48,463% of 1,000484,630

As a fraction of 10048,463/100

Read another way

As seconds13 hours, 27 minutes and 43 seconds

As bytes47.327 KiB

As a 24-bit colour#00BD4F

Keep nerding

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