Nerdulator> put something in

Recognised as Number

24,368

  • Positive
  • Even
  • Composite
  • 5 digits

24,368 is an even 5-digit integer and a composite number. It has 10 divisors and a digital root of 5.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value24,368
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 numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^4 × 1,523
Distinct prime factors22, 1,523
Number of divisors10
Sum of divisors σ(n)47,244
Aliquot sum22,876sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)12,176integers below n that share no factor with it
Carmichael function λ(n)3,044the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 12,176
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 1,523, 3,046, 6,092, 12,184, 24,36810 in total

Arithmetic

Previous number24,367
Next number24,369
Double48,736
Half12,184
Square root156.102530409≈irrational, shown to 9 decimal places
Cube root28.991674185≈
Negation-24,368
Reciprocal0.0000410374≈

Representations

Decimal24,368
Binary10111110011000015 bits
Octal57460
Hexadecimal5F30
Base 36ISW
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-four thousand, three hundred and sixty-eight
Ordinaltwenty-four thousand, three hundred and sixty-eighth
Scientific notation2.4368 × 10^4
Engineering notation24.368 × 10^3

In other bases

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

Bit-level

0101111100110000
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 even
Highest set bitbit 14worth 16,384
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes25f 30
Gray code111000010101000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0101111100110000
32-bit00000000000000000101111100110000
64-bit0000000000000000000000000000000000000000000000000101111100110000
One's complement1010000011001111at 16 bits, every bit flipped
Bits reversed0000110011111010at 16 bits
Rotated left by 11011111001100000at 16 bits, wrapping
Shifted left by 11011111001100000= 48,736, no wrap
Shifted right by 110111110011000= 12,184, discarding the low bit
These bits as a double1.20393917 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime24,371+3
Previous prime24,359−9
Distance to nearest prime3
Nearest square below24,336
Nearest square above24,649

Powers & multiples

24,368 to the power 2593,799,424
24,368 to the power 314,469,704,364,032
24,368 to the power 4352,597,755,942,731,776
24,368 to the power 58,592,102,116,812,487,917,568
First ten multiples24,368, 48,736, 73,104, 97,472, 121,840, 146,208, 170,576, 194,944, 219,312, 243,680
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 138the total stopping time
Highest value reached24,368
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps24,368 → 12,184 → 6,092 → 3,046 → 1,523 → 4,570 → 2,285 → 6,856 → 3,428 → 1,714 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,436,800%
24,368% as a decimal243.68
24,368% of 10024,368
24,368% of 1,000243,680
As a fraction of 10024,368/100

Read another way

As bytes23.797 KiB
As a 24-bit colour#005F30

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