Recognised as Number

22,541

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value22,541

Digit count5

Digit sum14

Digit product80

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation22,541

Distinct prime factors122,541

Number of divisors2

Sum of divisors σ(n)22,542

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Arithmetic

Previous number22,540

Next number22,542

Double45,082

Half11,270.5

Square508,096,681

Cube11,453,007,286,421

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

Cube root28.248218229≈

Negation-22,541

Reciprocal0.0000443636≈

Representations

Decimal22,541

Binary10110000000110115 bits

Octal54015

Hexadecimal580D

Base 36HE5

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

In wordstwenty-two thousand, five hundred and forty-one

Ordinaltwenty-two thousand, five hundred and forty-first

Scientific notation2.2541 × 10^4

Engineering notation22.541 × 10^3

In other bases

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

Quinary1210131base 5; one hand: 7 digits

Septenary122501base 7: 6 digits

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

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

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

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

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

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

Bit-level

0101100000001101

Bit length15 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits9within that length

Bit parityeven6 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 0d

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

At each machine width

16-bit0101100000001101

32-bit00000000000000000101100000001101

64-bit0000000000000000000000000000000000000000000000000101100000001101

One's complement1010011111110010at 16 bits, every bit flipped

Bits reversed1011000000011010at 16 bits

Rotated left by 11011000000011010at 16 bits, wrapping

Shifted left by 11011000000011010= 45,082, no wrap

Shifted right by 110110000000110= 11,270, discarding the low bit

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

Nearest landmarks

Next prime22,543+2

Previous prime22,531−10

Distance to nearest prime0, it is prime

Nearest square below22,500

Nearest square above22,801

Powers & multiples

22,541 to the power 2508,096,681

22,541 to the power 311,453,007,286,421

22,541 to the power 4258,162,237,243,215,761

22,541 to the power 55,819,234,989,699,326,468,701

First ten multiples22,541, 45,082, 67,623, 90,164, 112,705, 135,246, 157,787, 180,328, 202,869, 225,410

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 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 5

Divisible by 10No, remainder 1

Divisible by 11No, remainder 2

Divisible by 12No, remainder 5

Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 187the total stopping time

Highest value reached67,6243× the starting value

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

First steps22,541 → 67,624 → 33,812 → 16,906 → 8,453 → 25,360 → 12,680 → 6,340 → 3,170 → 1,585 → …

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

As a percentage & fraction

As a percentage2,254,100%

22,541% as a decimal225.41

22,541% of 10022,541

22,541% of 1,000225,410

As a fraction of 10022,541/100

Read another way

As seconds6 hours, 15 minutes and 41 seconds

As bytes22.013 KiB

As a 24-bit colour#00580D

Keep nerding

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