Recognised as Number

23,007

Positive
Odd
Composite
5 digits

23,007 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value23,007

Digit count5

Digit sum12

Digit product0zero, because one of the digits is zero

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 7,669

Distinct prime factors23, 7,669

Number of divisors4

Sum of divisors σ(n)30,680

Aliquot sum7,673sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)7,668the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 15,336

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 7,669, 23,0074 in total

Arithmetic

Previous number23,006

Next number23,008

Double46,014

Half11,503.5

Square529,322,049

Cube12,178,112,381,343

Square root151.680585442≈irrational, shown to 9 decimal places

Cube root28.441554588≈

Negation-23,007

Reciprocal0.000043465≈

Representations

Decimal23,007

Binary10110011101111115 bits

Octal54737

Hexadecimal59DF

Base 36HR3

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

In wordstwenty-three thousand and seven

Ordinaltwenty-three thousand and seventh

Scientific notation2.3007 × 10^4

Engineering notation23.007 × 10^3

In other bases

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

Quinary1214012base 5; one hand: 7 digits

Septenary124035base 7: 6 digits

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

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

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

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

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

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

Bit-level

0101100111011111

Bit length15 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits4within that length

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

Bytes259 df

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

At each machine width

16-bit0101100111011111

32-bit00000000000000000101100111011111

64-bit0000000000000000000000000000000000000000000000000101100111011111

One's complement1010011000100000at 16 bits, every bit flipped

Bits reversed1111101110011010at 16 bits

Rotated left by 11011001110111110at 16 bits, wrapping

Shifted left by 11011001110111110= 46,014, no wrap

Shifted right by 110110011101111= 11,503, discarding the low bit

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

Nearest landmarks

Next prime23,011+4

Previous prime23,003−4

Distance to nearest prime4

Nearest square below22,801

Nearest square above23,104

Powers & multiples

23,007 to the power 2529,322,049

23,007 to the power 312,178,112,381,343

23,007 to the power 4280,181,831,557,558,401

23,007 to the power 56,446,143,398,644,746,131,807

First ten multiples23,007, 46,014, 69,021, 92,028, 115,035, 138,042, 161,049, 184,056, 207,063, 230,070

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 7

Divisible by 9No, remainder 3

Divisible by 10No, remainder 7

Divisible by 11No, remainder 6

Divisible by 12No, remainder 3

Divisible by 100No, remainder 7

Collatz (3n + 1) trajectory

Steps to reach 1237the total stopping time

Highest value reached1,119,47248× the starting value

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

First steps23,007 → 69,022 → 34,511 → 103,534 → 51,767 → 155,302 → 77,651 → 232,954 → 116,477 → 349,432 → …

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

As a percentage & fraction

As a percentage2,300,700%

23,007% as a decimal230.07

23,007% of 10023,007

23,007% of 1,000230,070

As a fraction of 10023,007/100

Read another way

As seconds6 hours, 23 minutes and 27 seconds

As bytes22.468 KiB

As a 24-bit colour#0059DF

Keep nerding

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