Recognised as Number

22,699

Positive
Odd
Prime
5 digits

22,699 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 value22,699

Digit count5

Digit sum28

Digit product1,944

Multiplicative persistence4times 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 factorisation22,699

Distinct prime factors122,699

Number of divisors2

Sum of divisors σ(n)22,700

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)22,698the 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, 22,6992 in total

Arithmetic

Previous number22,698

Next number22,700

Double45,398

Half11,349.5

Square515,244,601

Cube11,695,537,198,099

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

Cube root28.314066101≈

Negation-22,699

Reciprocal0.0000440548≈

Representations

Decimal22,699

Binary10110001010101115 bits

Octal54253

Hexadecimal58AB

Base 36HIJ

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

In wordstwenty-two thousand, six hundred and ninety-nine

Ordinaltwenty-two thousand, six hundred and ninety-ninth

Scientific notation2.2699 × 10^4

Engineering notation22.699 × 10^3

In other bases

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

Quinary1211244base 5; one hand: 7 digits

Septenary123115base 7: 6 digits

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

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

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

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

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

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

Bit-level

0101100010101011

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 ab

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

At each machine width

16-bit0101100010101011

32-bit00000000000000000101100010101011

64-bit0000000000000000000000000000000000000000000000000101100010101011

One's complement1010011101010100at 16 bits, every bit flipped

Bits reversed1101010100011010at 16 bits

Rotated left by 11011000101010110at 16 bits, wrapping

Shifted left by 11011000101010110= 45,398, no wrap

Shifted right by 110110001010101= 11,349, discarding the low bit

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

Nearest landmarks

Next prime22,709+10

Previous prime22,697−2

Distance to nearest prime0, it is prime

Nearest square below22,500

Nearest square above22,801

Powers & multiples

22,699 to the power 2515,244,601

22,699 to the power 311,695,537,198,099

22,699 to the power 4265,476,998,859,649,201

22,699 to the power 56,026,062,397,115,177,213,499

First ten multiples22,699, 45,398, 68,097, 90,796, 113,495, 136,194, 158,893, 181,592, 204,291, 226,990

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 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 3

Divisible by 9No, remainder 1

Divisible by 10No, remainder 9

Divisible by 11No, remainder 6

Divisible by 12No, remainder 7

Divisible by 100No, remainder 99

Collatz (3n + 1) trajectory

Steps to reach 1162the total stopping time

Highest value reached102,1484× the starting value

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

First steps22,699 → 68,098 → 34,049 → 102,148 → 51,074 → 25,537 → 76,612 → 38,306 → 19,153 → 57,460 → …

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

As a percentage & fraction

As a percentage2,269,900%

22,699% as a decimal226.99

22,699% of 10022,699

22,699% of 1,000226,990

As a fraction of 10022,699/100

Read another way

As seconds6 hours, 18 minutes and 19 seconds

As bytes22.167 KiB

As a 24-bit colour#0058AB

Keep nerding

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