Base | Representation |
---|---|
bin | 1001100110001001100100… |
… | …11010010111111110100001 |
3 | 2202201100000001200222122001 |
4 | 10303010302122113332201 |
5 | 10231213414121200001 |
6 | 112514044553244001 |
7 | 4305366505224541 |
oct | 463046232277641 |
9 | 82640001628561 |
10 | 21102020100001 |
11 | 67a6353244065 |
12 | 2449867a03601 |
13 | ba0bb1753149 |
14 | 52d4b3b33321 |
15 | 268da2d6a001 |
hex | 133132697fa1 |
21102020100001 has 4 divisors (see below), whose sum is σ = 21102067876032. Its totient is φ = 21101972323972.
The previous prime is 21102020099807. The next prime is 21102020100019. The reversal of 21102020100001 is 10000102020112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 21102020100001 - 211 = 21102020097953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21102020100061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23219245 + ... + 24110938.
It is an arithmetic number, because the mean of its divisors is an integer number (5275516969008).
Almost surely, 221102020100001 is an apocalyptic number.
It is an amenable number.
21102020100001 is a deficient number, since it is larger than the sum of its proper divisors (47776031).
21102020100001 is an equidigital number, since it uses as much as digits as its factorization.
21102020100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47776030.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 21102020100001 its reverse (10000102020112), we get a palindrome (31102122120113).
The spelling of 21102020100001 in words is "twenty-one trillion, one hundred two billion, twenty million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •