Base | Representation |
---|---|
bin | 10110110000101011011100… |
… | …101111011011100111111011 |
3 | 111010102200022012202120212221 |
4 | 112300223130233123213323 |
5 | 101110033312033101021 |
6 | 552522153155544511 |
7 | 30041101053166165 |
oct | 2660533457334773 |
9 | 433380265676787 |
10 | 100102211222011 |
11 | 29994122637089 |
12 | b28858bbbb137 |
13 | 43b17a0ab5b7b |
14 | 1aa0d897d1935 |
15 | b88d4cbe1241 |
hex | 5b0adcbdb9fb |
100102211222011 has 4 divisors (see below), whose sum is σ = 100293611243992. Its totient is φ = 99910811200032.
The previous prime is 100102211221939. The next prime is 100102211222021. The reversal of 100102211222011 is 110222112201001.
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 100102211222011 - 29 = 100102211221499 is a prime.
It is a super-2 number, since 2×1001022112220112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100102211222021) 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, 95700010206 + ... + 95700011251.
It is an arithmetic number, because the mean of its divisors is an integer number (25073402810998).
Almost surely, 2100102211222011 is an apocalyptic number.
100102211222011 is a deficient number, since it is larger than the sum of its proper divisors (191400021981).
100102211222011 is an equidigital number, since it uses as much as digits as its factorization.
100102211222011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 191400021980.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 100102211222011 its reverse (110222112201001), we get a palindrome (210324323423012).
The spelling of 100102211222011 in words is "one hundred trillion, one hundred two billion, two hundred eleven million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •