Recognised as Number

22,707

Positive
Odd
Composite
5 digits

22,707 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value22,707

Digit count5

Digit sum18

Digit product0zero, because one of the digits is zero

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^3 × 29^2

Distinct prime factors23, 29

Number of divisors12

Sum of divisors σ(n)34,840

Aliquot sum12,133sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 27, 29, 87, 261, 783, 841, 2,523, 7,569, 22,70712 in total

Arithmetic

Previous number22,706

Next number22,708

Double45,414

Half11,353.5

Square515,607,849

Cube11,707,907,427,243

Square root150.688420258≈irrational, shown to 9 decimal places

Cube root28.317392032≈

Negation-22,707

Reciprocal0.0000440393≈

Representations

Decimal22,707

Binary10110001011001115 bits

Octal54263

Hexadecimal58B3

Base 36HIR

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

In wordstwenty-two thousand, seven hundred and seven

Ordinaltwenty-two thousand, seven hundred and seventh

Scientific notation2.2707 × 10^4

Engineering notation22.707 × 10^3

In other bases

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

Quinary1211312base 5; one hand: 7 digits

Septenary123126base 7: 6 digits

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

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

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

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

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

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

Bit-level

0101100010110011

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 odd

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes258 b3

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

At each machine width

16-bit0101100010110011

32-bit00000000000000000101100010110011

64-bit0000000000000000000000000000000000000000000000000101100010110011

One's complement1010011101001100at 16 bits, every bit flipped

Bits reversed1100110100011010at 16 bits

Rotated left by 11011000101100110at 16 bits, wrapping

Shifted left by 11011000101100110= 45,414, no wrap

Shifted right by 110110001011001= 11,353, discarding the low bit

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

Nearest landmarks

Next prime22,709+2

Previous prime22,699−8

Distance to nearest prime2

Nearest square below22,500

Nearest square above22,801

Powers & multiples

22,707 to the power 2515,607,849

22,707 to the power 311,707,907,427,243

22,707 to the power 4265,851,453,950,406,801

22,707 to the power 56,036,688,964,851,887,230,307

First ten multiples22,707, 45,414, 68,121, 90,828, 113,535, 136,242, 158,949, 181,656, 204,363, 227,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 6

Divisible by 8No, remainder 3

Divisible by 9Yes

Divisible by 10No, remainder 7

Divisible by 11No, remainder 3

Divisible by 12No, remainder 3

Divisible by 100No, remainder 7

Collatz (3n + 1) trajectory

Steps to reach 143the total stopping time

Highest value reached102,1844× the starting value

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

First steps22,707 → 68,122 → 34,061 → 102,184 → 51,092 → 25,546 → 12,773 → 38,320 → 19,160 → 9,580 → …

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

As a percentage & fraction

As a percentage2,270,700%

22,707% as a decimal227.07

22,707% of 10022,707

22,707% of 1,000227,070

As a fraction of 10022,707/100

Read another way

As seconds6 hours, 18 minutes and 27 seconds

As bytes22.175 KiB

As a 24-bit colour#0058B3

Keep nerding

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