Recognised as Number

20,101

Positive
Odd
Prime
5 digits

20,101 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 value20,101

Digit count5

Digit sum4

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation20,101

Distinct prime factors120,101

Number of divisors2

Sum of divisors σ(n)20,102

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)20,100the 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, 20,1012 in total

Arithmetic

Previous number20,100

Next number20,102

Double40,202

Half10,050.5

Square404,050,201

Cube8,121,813,090,301

Square root141.777995472≈irrational, shown to 9 decimal places

Cube root27.189792162≈

Negation-20,101

Reciprocal0.0000497488≈

Representations

Decimal20,101

Binary10011101000010115 bits

Octal47205

Hexadecimal4E85

Base 36FID

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

In wordstwenty thousand, one hundred and one

Ordinaltwenty thousand, one hundred and first

Scientific notation2.0101 × 10^4

Engineering notation20.101 × 10^3

In other bases

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

Quinary1120401base 5; one hand: 7 digits

Septenary112414base 7: 6 digits

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

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

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

Sexagesimal5:35:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0100111010000101

Bit length15 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits8within that length

Bit parityodd7 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

Bytes24e 85

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

At each machine width

16-bit0100111010000101

32-bit00000000000000000100111010000101

64-bit0000000000000000000000000000000000000000000000000100111010000101

One's complement1011000101111010at 16 bits, every bit flipped

Bits reversed1010000101110010at 16 bits

Rotated left by 11001110100001010at 16 bits, wrapping

Shifted left by 11001110100001010= 40,202, no wrap

Shifted right by 110011101000010= 10,050, discarding the low bit

These bits as a double9.93121355 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime20,107+6

Previous prime20,089−12

Distance to nearest prime0, it is prime

Nearest square below19,881

Nearest square above20,164

Powers & multiples

20,101 to the power 2404,050,201

20,101 to the power 38,121,813,090,301

20,101 to the power 4163,256,564,928,140,401

20,101 to the power 53,281,620,211,620,550,200,501

First ten multiples20,101, 40,202, 60,303, 80,404, 100,505, 120,606, 140,707, 160,808, 180,909, 201,010

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 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 5

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 4

Divisible by 12No, remainder 1

Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1118the total stopping time

Highest value reached60,3043× the starting value

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

First steps20,101 → 60,304 → 30,152 → 15,076 → 7,538 → 3,769 → 11,308 → 5,654 → 2,827 → 8,482 → …

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

As a percentage & fraction

As a percentage2,010,100%

20,101% as a decimal201.01

20,101% of 10020,101

20,101% of 1,000201,010

As a fraction of 10020,101/100

Read another way

As seconds5 hours, 35 minutes and 1 second

As bytes19.63 KiB

As a 24-bit colour#004E85

Keep nerding

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