Nerdulator> put something in

Recognised as Number

21,212

  • Positive
  • Even
  • Composite
  • 5 digits

21,212 is an even 5-digit integer and a composite number. It has 6 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value21,212
Digit count5
Digit sum8
Digit product8
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicYesreads the same backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 5,303
Distinct prime factors22, 5,303
Number of divisors6
Sum of divisors σ(n)37,128
Aliquot sum15,916sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)10,604integers below n that share no factor with it
Carmichael function λ(n)5,302the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 10,604
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5,303, 10,606, 21,2126 in total

Arithmetic

Previous number21,211
Next number21,213
Double42,424
Half10,606
Square root145.643400125≈irrational, shown to 9 decimal places
Cube root27.681771078≈
Negation-21,212
Reciprocal0.0000471431≈

Representations

Decimal21,212
Binary10100101101110015 bits
Octal51334
Hexadecimal52DC
Base 36GD8
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-one thousand, two hundred and twelve
Ordinaltwenty-one thousand, two hundred and twelfth
Scientific notation2.1212 × 10^4
Engineering notation21.212 × 10^3

In other bases

Ternary1002002122base 3; the most digit-efficient integer base after e: 10 digits
Quinary1134322base 5; one hand: 7 digits
Septenary115562base 7: 6 digits
Nonary32078base 9; each digit is two ternary digits: 5 digits
Duodecimal10338base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal2d0cbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal5:53:32base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary101T010T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011100101100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0101001011011100
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 even
Highest set bitbit 14worth 16,384
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes252 dc
Gray code111101110110010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0101001011011100
32-bit00000000000000000101001011011100
64-bit0000000000000000000000000000000000000000000000000101001011011100
One's complement1010110100100011at 16 bits, every bit flipped
Bits reversed0011101101001010at 16 bits
Rotated left by 11010010110111000at 16 bits, wrapping
Shifted left by 11010010110111000= 42,424, no wrap
Shifted right by 110100101101110= 10,606, discarding the low bit
These bits as a double1.04801205 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime21,221+9
Previous prime21,211−1
Distance to nearest prime1
Nearest square below21,025
Nearest square above21,316

Powers & multiples

21,212 to the power 2449,948,944
21,212 to the power 39,544,317,000,128
21,212 to the power 4202,454,052,206,715,136
21,212 to the power 54,294,455,355,408,841,464,832
First ten multiples21,212, 42,424, 63,636, 84,848, 106,060, 127,272, 148,484, 169,696, 190,908, 212,120
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8No, remainder 4
Divisible by 9No, remainder 8
Divisible by 10No, remainder 2
Divisible by 11No, remainder 4
Divisible by 12No, remainder 8
Divisible by 100No, remainder 12

Collatz (3n + 1) trajectory

Steps to reach 1149the total stopping time
Highest value reached35,8001× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps21,212 → 10,606 → 5,303 → 15,910 → 7,955 → 23,866 → 11,933 → 35,800 → 17,900 → 8,950 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,121,200%
21,212% as a decimal212.12
21,212% of 10021,212
21,212% of 1,000212,120
As a fraction of 10021,212/100

Read another way

As bytes20.715 KiB
As a 24-bit colour#0052DC

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 “21212” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.