Nerdulator> put something in

Recognised as Number

24,875

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value24,875
Digit count5
Digit sum26
Digit product2,240
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5^3 × 199
Distinct prime factors25, 199
Number of divisors8
Sum of divisors σ(n)31,200
Aliquot sum6,325sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)19,800integers below n that share no factor with it
Carmichael function λ(n)9,900the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 19,800
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 5, 25, 125, 199, 995, 4,975, 24,8758 in total

Arithmetic

Previous number24,874
Next number24,876
Double49,750
Square root157.718102956≈irrational, shown to 9 decimal places
Cube root29.191362304≈
Negation-24,875
Reciprocal0.000040201≈

Representations

Decimal24,875
Binary11000010010101115 bits
Octal60453
Hexadecimal612B
Base 36J6Z
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-four thousand, eight hundred and seventy-five
Ordinaltwenty-four thousand, eight hundred and seventy-fifth
Scientific notation2.4875 × 10^4
Engineering notation24.875 × 10^3

In other bases

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

Bit-level

0110000100101011
Bit length15 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits8within that length
Bit parityodd7 set bits, so odd; 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 2b
Gray code101000110111110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0110000100101011
32-bit00000000000000000110000100101011
64-bit0000000000000000000000000000000000000000000000000110000100101011
One's complement1001111011010100at 16 bits, every bit flipped
Bits reversed1101010010000110at 16 bits
Rotated left by 11100001001010110at 16 bits, wrapping
Shifted left by 11100001001010110= 49,750, no wrap
Shifted right by 111000010010101= 12,437, discarding the low bit
These bits as a double1.22898829 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime24,877+2
Previous prime24,859−16
Distance to nearest prime2
Nearest square below24,649
Nearest square above24,964

Powers & multiples

24,875 to the power 2618,765,625
24,875 to the power 315,391,794,921,875
24,875 to the power 4382,870,898,681,640,625
24,875 to the power 59,523,913,604,705,810,546,875
First ten multiples24,875, 49,750, 74,625, 99,500, 124,375, 149,250, 174,125, 199,000, 223,875, 248,750
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 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 5
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 75

Collatz (3n + 1) trajectory

Steps to reach 195the total stopping time
Highest value reached179,3327× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps24,875 → 74,626 → 37,313 → 111,940 → 55,970 → 27,985 → 83,956 → 41,978 → 20,989 → 62,968 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,487,500%
24,875% as a decimal248.75
24,875% of 10024,875
24,875% of 1,000248,750
As a fraction of 10024,875/100

Read another way

As bytes24.292 KiB
As a 24-bit colour#00612B

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