Recognised as Number

23,671

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value23,671

Digit count5

Digit sum19

Digit product252

Multiplicative persistence3times the digit product can be taken before one digit is left

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation23,671

Distinct prime factors123,671

Number of divisors2

Sum of divisors σ(n)23,672

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Arithmetic

Previous number23,670

Next number23,672

Double47,342

Half11,835.5

Square560,316,241

Cube13,263,245,740,711

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

Cube root28.712578913≈

Negation-23,671

Reciprocal0.0000422458≈

Representations

Decimal23,671

Binary10111000111011115 bits

Octal56167

Hexadecimal5C77

Base 36I9J

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

In wordstwenty-three thousand, six hundred and seventy-one

Ordinaltwenty-three thousand, six hundred and seventy-first

Scientific notation2.3671 × 10^4

Engineering notation23.671 × 10^3

In other bases

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

Quinary1224141base 5; one hand: 7 digits

Septenary126004base 7: 6 digits

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

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

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

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

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

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

Bit-level

0101110001110111

Bit length15 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits5within that length

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

Bytes25c 77

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

At each machine width

16-bit0101110001110111

32-bit00000000000000000101110001110111

64-bit0000000000000000000000000000000000000000000000000101110001110111

One's complement1010001110001000at 16 bits, every bit flipped

Bits reversed1110111000111010at 16 bits

Rotated left by 11011100011101110at 16 bits, wrapping

Shifted left by 11011100011101110= 47,342, no wrap

Shifted right by 110111000111011= 11,835, discarding the low bit

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

Nearest landmarks

Next prime23,677+6

Previous prime23,669−2

Distance to nearest prime0, it is prime

Nearest square below23,409

Nearest square above23,716

Powers & multiples

23,671 to the power 2560,316,241

23,671 to the power 313,263,245,740,711

23,671 to the power 4313,954,289,928,370,081

23,671 to the power 57,431,611,996,894,448,187,351

First ten multiples23,671, 47,342, 71,013, 94,684, 118,355, 142,026, 165,697, 189,368, 213,039, 236,710

Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 1

Divisible by 10No, remainder 1

Divisible by 11No, remainder 10

Divisible by 12No, remainder 7

Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 1175the total stopping time

Highest value reached159,7846× the starting value

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

First steps23,671 → 71,014 → 35,507 → 106,522 → 53,261 → 159,784 → 79,892 → 39,946 → 19,973 → 59,920 → …

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

As a percentage & fraction

As a percentage2,367,100%

23,671% as a decimal236.71

23,671% of 10023,671

23,671% of 1,000236,710

As a fraction of 10023,671/100

Read another way

As seconds6 hours, 34 minutes and 31 seconds

As bytes23.116 KiB

As a 24-bit colour#005C77

Keep nerding

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