Base | Representation |
---|---|
bin | 10110101111010111011011… |
… | …101111110001010000110011 |
3 | 111010010001110020211212201010 |
4 | 112233113123233301100303 |
5 | 101102044034024021321 |
6 | 552412513441042003 |
7 | 30031425412264062 |
oct | 2657273357612063 |
9 | 433101406755633 |
10 | 100012000220211 |
11 | 2995993a8a9242 |
12 | b272bb4626303 |
13 | 43a6125356a71 |
14 | 1a9a86c88a1d9 |
15 | b8681d085676 |
hex | 5af5dbbf1433 |
100012000220211 has 48 divisors (see below), whose sum is σ = 142192201627008. Its totient is φ = 62514677836800.
The previous prime is 100012000220183. The next prime is 100012000220227. The reversal of 100012000220211 is 112022000210001.
It is not a de Polignac number, because 100012000220211 - 25 = 100012000220179 is a prime.
It is a super-2 number, since 2×1000120002202112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100012000224211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1092134056 + ... + 1092225626.
It is an arithmetic number, because the mean of its divisors is an integer number (2962337533896).
Almost surely, 2100012000220211 is an apocalyptic number.
100012000220211 is a deficient number, since it is larger than the sum of its proper divisors (42180201406797).
100012000220211 is a wasteful number, since it uses less digits than its factorization.
100012000220211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96372 (or 96355 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 100012000220211 its reverse (112022000210001), we get a palindrome (212034000430212).
The spelling of 100012000220211 in words is "one hundred trillion, twelve billion, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •