Base | Representation |
---|---|
bin | 10110110010000110100010… |
… | …000000111101111110001011 |
3 | 111010210000201222210222221010 |
4 | 112302012202000331332023 |
5 | 101113134110103224321 |
6 | 553035125455415003 |
7 | 30051132442655451 |
oct | 2662064200757613 |
9 | 433700658728833 |
10 | 100200010211211 |
11 | 29a21649612199 |
12 | b2a3524824463 |
13 | 43baa885cbb51 |
14 | 1aa59c63d09d1 |
15 | b8b673aae676 |
hex | 5b21a203df8b |
100200010211211 has 4 divisors (see below), whose sum is σ = 133600013614952. Its totient is φ = 66800006807472.
The previous prime is 100200010211209. The next prime is 100200010211309. The reversal of 100200010211211 is 112112010002001.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 100200010211211 - 21 = 100200010211209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100200010211201) 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, 16700001701866 + ... + 16700001701871.
It is an arithmetic number, because the mean of its divisors is an integer number (33400003403738).
Almost surely, 2100200010211211 is an apocalyptic number.
100200010211211 is a deficient number, since it is larger than the sum of its proper divisors (33400003403741).
100200010211211 is an equidigital number, since it uses as much as digits as its factorization.
100200010211211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33400003403740.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100200010211211 its reverse (112112010002001), we get a palindrome (212312020213212).
The spelling of 100200010211211 in words is "one hundred trillion, two hundred billion, ten million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •