Nerdulator> put something in

Recognised as Number

23,368

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value23,368
Digit count5
Digit sum22
Digit product864
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 23 × 127
Distinct prime factors32, 23, 127
Number of divisors16
Sum of divisors σ(n)46,080
Aliquot sum22,712sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)11,088integers below n that share no factor with it
Carmichael function λ(n)1,386the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 11,088
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 23, 46, 92, 127, 184, 254, 508, 1,016, 2,921, 5,842, 11,684, 23,36816 in total

Arithmetic

Previous number23,367
Next number23,369
Double46,736
Half11,684
Square root152.865954352≈irrational, shown to 9 decimal places
Cube root28.589540897≈
Negation-23,368
Reciprocal0.0000427936≈

Representations

Decimal23,368
Binary10110110100100015 bits
Octal55510
Hexadecimal5B48
Base 36I14
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-three thousand, three hundred and sixty-eight
Ordinaltwenty-three thousand, three hundred and sixty-eighth
Scientific notation2.3368 × 10^4
Engineering notation23.368 × 10^3

In other bases

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

Bit-level

0101101101001000
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 even
Highest set bitbit 14worth 16,384
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes25b 48
Gray code111011011101100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0101101101001000
32-bit00000000000000000101101101001000
64-bit0000000000000000000000000000000000000000000000000101101101001000
One's complement1010010010110111at 16 bits, every bit flipped
Bits reversed0001001011011010at 16 bits
Rotated left by 11011011010010000at 16 bits, wrapping
Shifted left by 11011011010010000= 46,736, no wrap
Shifted right by 110110110100100= 11,684, discarding the low bit
These bits as a double1.1545326 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime23,369+1
Previous prime23,357−11
Distance to nearest prime1
Nearest square below23,104
Nearest square above23,409

Powers & multiples

23,368 to the power 2546,063,424
23,368 to the power 312,760,410,092,032
23,368 to the power 4298,185,263,030,603,776
23,368 to the power 56,967,993,226,499,149,037,568
First ten multiples23,368, 46,736, 70,104, 93,472, 116,840, 140,208, 163,576, 186,944, 210,312, 233,680
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 182the total stopping time
Highest value reached23,368
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps23,368 → 11,684 → 5,842 → 2,921 → 8,764 → 4,382 → 2,191 → 6,574 → 3,287 → 9,862 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,336,800%
23,368% as a decimal233.68
23,368% of 10023,368
23,368% of 1,000233,680
As a fraction of 10023,368/100

Read another way

As bytes22.82 KiB
As a 24-bit colour#005B48

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