Base | Representation |
---|---|
bin | 101111110001101010100010… |
… | …110101100111101010100001 |
3 | 1000112222101100021022102222120 |
4 | 233301222202311213222201 |
5 | 210020111024214120001 |
6 | 2022520151051454453 |
7 | 62154515166111633 |
oct | 5761524265475241 |
9 | 1015871307272876 |
10 | 210121122020001 |
11 | 60a5095a596745 |
12 | 1b696a6a757429 |
13 | 903244bbc210a |
14 | 39c5cb90caa53 |
15 | 1945aec71d236 |
hex | bf1aa2d67aa1 |
210121122020001 has 4 divisors (see below), whose sum is σ = 280161496026672. Its totient is φ = 140080748013332.
The previous prime is 210121122019981. The next prime is 210121122020023. The reversal of 210121122020001 is 100020221121012.
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 210121122020001 - 226 = 210121054911137 is a prime.
It is not an unprimeable number, because it can be changed into a prime (210121122020041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35020187003331 + ... + 35020187003336.
It is an arithmetic number, because the mean of its divisors is an integer number (70040374006668).
Almost surely, 2210121122020001 is an apocalyptic number.
It is an amenable number.
210121122020001 is a deficient number, since it is larger than the sum of its proper divisors (70040374006671).
210121122020001 is an equidigital number, since it uses as much as digits as its factorization.
210121122020001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70040374006670.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 210121122020001 its reverse (100020221121012), we get a palindrome (310141343141013).
The spelling of 210121122020001 in words is "two hundred ten trillion, one hundred twenty-one billion, one hundred twenty-two million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •