Base | Representation |
---|---|
bin | 10110110010000110100001… |
… | …100010000010001111000011 |
3 | 111010210000201102120000110210 |
4 | 112302012201202002033003 |
5 | 101113134101014232321 |
6 | 553035125005525203 |
7 | 30051132314023164 |
oct | 2662064142021703 |
9 | 433700642500423 |
10 | 100200002102211 |
11 | 29a21644a83840 |
12 | b2a3521b73803 |
13 | 43baa86a1cc1b |
14 | 1aa59c52bd76b |
15 | b8b67300bb76 |
hex | 5b21a18823c3 |
100200002102211 has 16 divisors (see below), whose sum is σ = 153416271162240. Its totient is φ = 57531101685120.
The previous prime is 100200002102183. The next prime is 100200002102227. The reversal of 100200002102211 is 112201200002001.
It is not a de Polignac number, because 100200002102211 - 242 = 95801955591107 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100200002102251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 79904307270 + ... + 79904308523.
It is an arithmetic number, because the mean of its divisors is an integer number (9588516947640).
Almost surely, 2100200002102211 is an apocalyptic number.
100200002102211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100200002102211 is a deficient number, since it is larger than the sum of its proper divisors (53216269060029).
100200002102211 is a wasteful number, since it uses less digits than its factorization.
100200002102211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159808615826.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 100200002102211 its reverse (112201200002001), we get a palindrome (212401202104212).
The spelling of 100200002102211 in words is "one hundred trillion, two hundred billion, two million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •