Nerdulator> put something in

Recognised as Number

22,243

  • Positive
  • Odd
  • Composite
  • 5 digits

22,243 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value22,243
Digit count5
Digit sum13
Digit product96
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation13 × 29 × 59
Distinct prime factors313, 29, 59
Number of divisors8
Sum of divisors σ(n)25,200
Aliquot sum2,957sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)19,488integers below n that share no factor with it
Carmichael function λ(n)2,436the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 19,488
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 29, 59, 377, 767, 1,711, 22,2438 in total

Arithmetic

Previous number22,242
Next number22,244
Double44,486
Square root149.140873003≈irrational, shown to 9 decimal places
Cube root28.123181775≈
Negation-22,243
Reciprocal0.000044958≈

Representations

Decimal22,243
Binary10101101110001115 bits
Octal53343
Hexadecimal56E3
Base 36H5V
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-two thousand, two hundred and forty-three
Ordinaltwenty-two thousand, two hundred and forty-third
Scientific notation2.2243 × 10^4
Engineering notation22.243 × 10^3

In other bases

Ternary1010111211base 3; the most digit-efficient integer base after e: 10 digits
Quinary1202433base 5; one hand: 7 digits
Septenary121564base 7: 6 digits
Nonary33454base 9; each digit is two ternary digits: 5 digits
Duodecimal10a57base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal2fc3base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal6:10:43base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1011TTTT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101100100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0101011011100011
Bit length15 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits6within that length
Bit parityodd9 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
Bytes256 e3
Gray code111110110010010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0101011011100011
32-bit00000000000000000101011011100011
64-bit0000000000000000000000000000000000000000000000000101011011100011
One's complement1010100100011100at 16 bits, every bit flipped
Bits reversed1100011101101010at 16 bits
Rotated left by 11010110111000110at 16 bits, wrapping
Shifted left by 11010110111000110= 44,486, no wrap
Shifted right by 110101101110001= 11,121, discarding the low bit
These bits as a double1.09895022 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime22,247+4
Previous prime22,229−14
Distance to nearest prime4
Nearest square below22,201
Nearest square above22,500

Powers & multiples

22,243 to the power 2494,751,049
22,243 to the power 311,004,747,582,907
22,243 to the power 4244,778,600,486,600,401
22,243 to the power 55,444,610,410,623,452,719,443
First ten multiples22,243, 44,486, 66,729, 88,972, 111,215, 133,458, 155,701, 177,944, 200,187, 222,430
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 43

Collatz (3n + 1) trajectory

Steps to reach 1131the total stopping time
Highest value reached100,0964× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps22,243 → 66,730 → 33,365 → 100,096 → 50,048 → 25,024 → 12,512 → 6,256 → 3,128 → 1,564 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,224,300%
22,243% as a decimal222.43
22,243% of 10022,243
22,243% of 1,000222,430
As a fraction of 10022,243/100

Read another way

As bytes21.722 KiB
As a 24-bit colour#0056E3

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “22243” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.