Nerdulator> put something in

Recognised as Number

21,433

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value21,433
Digit count5
Digit sum13
Digit product72
Multiplicative persistence3times 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 numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation21,433
Distinct prime factors121,433
Number of divisors2
Sum of divisors σ(n)21,434
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)21,432integers below n that share no factor with it
Carmichael function λ(n)21,432the 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, 21,4332 in total

Arithmetic

Previous number21,432
Next number21,434
Double42,866
Square root146.400136612≈irrational, shown to 9 decimal places
Cube root27.777574517≈
Negation-21,433
Reciprocal0.000046657≈

Representations

Decimal21,433
Binary10100111011100115 bits
Octal51671
Hexadecimal53B9
Base 36GJD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-one thousand, four hundred and thirty-three
Ordinaltwenty-one thousand, four hundred and thirty-third
Scientific notation2.1433 × 10^4
Engineering notation21.433 × 10^3

In other bases

Ternary1002101211base 3; the most digit-efficient integer base after e: 10 digits
Quinary1141213base 5; one hand: 7 digits
Septenary116326base 7: 6 digits
Nonary32354base 9; each digit is two ternary digits: 5 digits
Duodecimal104a1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal2dbdbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal5:57:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary101T11TT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010011001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0101001110111001
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
Bytes253 b9
Gray code111101001100101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0101001110111001
32-bit00000000000000000101001110111001
64-bit0000000000000000000000000000000000000000000000000101001110111001
One's complement1010110001000110at 16 bits, every bit flipped
Bits reversed1001110111001010at 16 bits
Rotated left by 11010011101110010at 16 bits, wrapping
Shifted left by 11010011101110010= 42,866, no wrap
Shifted right by 110100111011100= 10,716, discarding the low bit
These bits as a double1.0589309 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime21,467+34
Previous prime21,419−14
Distance to nearest prime0, it is prime
Nearest square below21,316
Nearest square above21,609

Powers & multiples

21,433 to the power 2459,373,489
21,433 to the power 39,845,751,989,737
21,433 to the power 4211,024,002,396,033,121
21,433 to the power 54,522,877,443,354,177,882,393
First ten multiples21,433, 42,866, 64,299, 85,732, 107,165, 128,598, 150,031, 171,464, 192,897, 214,330
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 1193the total stopping time
Highest value reached77,2723× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps21,433 → 64,300 → 32,150 → 16,075 → 48,226 → 24,113 → 72,340 → 36,170 → 18,085 → 54,256 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,143,300%
21,433% as a decimal214.33
21,433% of 10021,433
21,433% of 1,000214,330
As a fraction of 10021,433/100

Read another way

As bytes20.931 KiB
As a 24-bit colour#0053B9

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