Base | Representation |
---|---|
bin | 10110110010000111101000… |
… | …111111011110011011100011 |
3 | 111010210010210222111110002111 |
4 | 112302013220333132123203 |
5 | 101113144024424032321 |
6 | 553035443554300151 |
7 | 30051204112350361 |
oct | 2662075077363343 |
9 | 433703728443074 |
10 | 100201201002211 |
11 | 29a220aa7a9091 |
12 | b2a37b7587657 |
13 | 43bac1821a7ca |
14 | 1aa5a9a604631 |
15 | b8b6e33cb5e1 |
hex | 5b21e8fde6e3 |
100201201002211 has 4 divisors (see below), whose sum is σ = 105474948423400. Its totient is φ = 94927453581024.
The previous prime is 100201201002193. The next prime is 100201201002223. The reversal of 100201201002211 is 112200102102001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100201201002211 - 25 = 100201201002179 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100201201002191 and 100201201002200.
It is not an unprimeable number, because it can be changed into a prime (100201201002311) 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, 2636873710566 + ... + 2636873710603.
It is an arithmetic number, because the mean of its divisors is an integer number (26368737105850).
Almost surely, 2100201201002211 is an apocalyptic number.
100201201002211 is a deficient number, since it is larger than the sum of its proper divisors (5273747421189).
100201201002211 is an equidigital number, since it uses as much as digits as its factorization.
100201201002211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5273747421188.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100201201002211 its reverse (112200102102001), we get a palindrome (212401303104212).
The spelling of 100201201002211 in words is "one hundred trillion, two hundred one billion, two hundred one million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.329 sec. • engine limits •