Recognised as Number

23,669

Positive
Odd
Prime
5 digits

23,669 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value23,669

Digit count5

Digit sum26

Digit product1,944

Multiplicative persistence4times 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 factorisation23,669

Distinct prime factors123,669

Number of divisors2

Sum of divisors σ(n)23,670

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)23,668the 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, 23,6692 in total

Arithmetic

Previous number23,668

Next number23,670

Double47,338

Half11,834.5

Square560,221,561

Cube13,259,884,127,309

Square root153.847326919≈irrational, shown to 9 decimal places

Cube root28.711770233≈

Negation-23,669

Reciprocal0.0000422494≈

Representations

Decimal23,669

Binary10111000111010115 bits

Octal56165

Hexadecimal5C75

Base 36I9H

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

In wordstwenty-three thousand, six hundred and sixty-nine

Ordinaltwenty-three thousand, six hundred and sixty-ninth

Scientific notation2.3669 × 10^4

Engineering notation23.669 × 10^3

In other bases

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

Quinary1224134base 5; one hand: 7 digits

Septenary126002base 7: 6 digits

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

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

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

Sexagesimal6:34:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0101110001110101

Bit length15 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits6within that length

Bit parityodd9 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

Bytes25c 75

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

At each machine width

16-bit0101110001110101

32-bit00000000000000000101110001110101

64-bit0000000000000000000000000000000000000000000000000101110001110101

One's complement1010001110001010at 16 bits, every bit flipped

Bits reversed1010111000111010at 16 bits

Rotated left by 11011100011101010at 16 bits, wrapping

Shifted left by 11011100011101010= 47,338, no wrap

Shifted right by 110111000111010= 11,834, discarding the low bit

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

Nearest landmarks

Next prime23,671+2

Previous prime23,663−6

Distance to nearest prime0, it is prime

Nearest square below23,409

Nearest square above23,716

Powers & multiples

23,669 to the power 2560,221,561

23,669 to the power 313,259,884,127,309

23,669 to the power 4313,848,197,409,276,721

23,669 to the power 57,428,472,984,480,170,709,349

First ten multiples23,669, 47,338, 71,007, 94,676, 118,345, 142,014, 165,683, 189,352, 213,021, 236,690

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 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 5

Divisible by 9No, remainder 8

Divisible by 10No, remainder 9

Divisible by 11No, remainder 8

Divisible by 12No, remainder 5

Divisible by 100No, remainder 69

Collatz (3n + 1) trajectory

Steps to reach 1100the total stopping time

Highest value reached71,0083× the starting value

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

First steps23,669 → 71,008 → 35,504 → 17,752 → 8,876 → 4,438 → 2,219 → 6,658 → 3,329 → 9,988 → …

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

As a percentage & fraction

As a percentage2,366,900%

23,669% as a decimal236.69

23,669% of 10023,669

23,669% of 1,000236,690

As a fraction of 10023,669/100

Read another way

As seconds6 hours, 34 minutes and 29 seconds

As bytes23.114 KiB

As a 24-bit colour#005C75

Keep nerding

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