Base | Representation |
---|---|
bin | 10110110000101011010001… |
… | …011010100100000001011011 |
3 | 111010102122210222012120110011 |
4 | 112300223101122210001123 |
5 | 101110032414411431021 |
6 | 552522122251102351 |
7 | 30041063255066053 |
oct | 2660532132440133 |
9 | 433378728176404 |
10 | 100102021202011 |
11 | 29994035350264 |
12 | b2885384419b7 |
13 | 43b17706142ba |
14 | 1aa0d6c48a563 |
15 | b88d3b1a8de1 |
hex | 5b0ad16a405b |
100102021202011 has 4 divisors (see below), whose sum is σ = 101308069650312. Its totient is φ = 98895972753712.
The previous prime is 100102021201997. The next prime is 100102021202021. The reversal of 100102021202011 is 110202120201001.
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 100102021202011 - 225 = 100101987647579 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100102021201982 and 100102021202000.
It is not an unprimeable number, because it can be changed into a prime (100102021202021) 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, 603024224026 + ... + 603024224191.
It is an arithmetic number, because the mean of its divisors is an integer number (25327017412578).
Almost surely, 2100102021202011 is an apocalyptic number.
100102021202011 is a deficient number, since it is larger than the sum of its proper divisors (1206048448301).
100102021202011 is an equidigital number, since it uses as much as digits as its factorization.
100102021202011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1206048448300.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100102021202011 its reverse (110202120201001), we get a palindrome (210304141403012).
The spelling of 100102021202011 in words is "one hundred trillion, one hundred two billion, twenty-one million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •