Nerdulator> put something in

Recognised as Number

24,863

  • Positive
  • Odd
  • Composite
  • 5 digits

24,863 is an odd 5-digit integer and a composite number. It has 6 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value24,863
Digit count5
Digit sum23
Digit product1,152
Multiplicative persistence3times 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 factorisation23^2 × 47
Distinct prime factors223, 47
Number of divisors6
Sum of divisors σ(n)26,544
Aliquot sum1,681sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)23,276integers below n that share no factor with it
Carmichael function λ(n)506the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 23,276
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 23, 47, 529, 1,081, 24,8636 in total

Arithmetic

Previous number24,862
Next number24,864
Double49,726
Square root157.680055809≈irrational, shown to 9 decimal places
Cube root29.186667461≈
Negation-24,863
Reciprocal0.0000402204≈

Representations

Decimal24,863
Binary11000010001111115 bits
Octal60437
Hexadecimal611F
Base 36J6N
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-four thousand, eight hundred and sixty-three
Ordinaltwenty-four thousand, eight hundred and sixty-third
Scientific notation2.4863 × 10^4
Engineering notation24.863 × 10^3

In other bases

Ternary1021002212base 3; the most digit-efficient integer base after e: 10 digits
Quinary1243423base 5; one hand: 7 digits
Septenary132326base 7: 6 digits
Nonary37085base 9; each digit is two ternary digits: 5 digits
Duodecimal1247bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3233base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal6:54:23base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11T10100TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010000101100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0110000100011111
Bit length15 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits7within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes261 1f
Gray code101000110010000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0110000100011111
32-bit00000000000000000110000100011111
64-bit0000000000000000000000000000000000000000000000000110000100011111
One's complement1001111011100000at 16 bits, every bit flipped
Bits reversed1111100010000110at 16 bits
Rotated left by 11100001000111110at 16 bits, wrapping
Shifted left by 11100001000111110= 49,726, no wrap
Shifted right by 111000010001111= 12,431, discarding the low bit
These bits as a double1.22839542 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime24,877+14
Previous prime24,859−4
Distance to nearest prime4
Nearest square below24,649
Nearest square above24,964

Powers & multiples

24,863 to the power 2618,168,769
24,863 to the power 315,369,530,103,647
24,863 to the power 4382,132,626,966,975,361
24,863 to the power 59,500,963,504,279,908,400,543
First ten multiples24,863, 49,726, 74,589, 99,452, 124,315, 149,178, 174,041, 198,904, 223,767, 248,630
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 164the total stopping time
Highest value reached377,62015× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps24,863 → 74,590 → 37,295 → 111,886 → 55,943 → 167,830 → 83,915 → 251,746 → 125,873 → 377,620 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,486,300%
24,863% as a decimal248.63
24,863% of 10024,863
24,863% of 1,000248,630
As a fraction of 10024,863/100

Read another way

As bytes24.28 KiB
As a 24-bit colour#00611F

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 “24863” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.