Base | Representation |
---|---|
bin | 10110101111010110101100… |
… | …000111000100100010010110 |
3 | 111010002222101120000102000011 |
4 | 112233112230013010202112 |
5 | 101102040414430201402 |
6 | 552412302251310434 |
7 | 30031366536230326 |
oct | 2657265407044226 |
9 | 433088346012004 |
10 | 100011201022102 |
11 | 2995956a765937 |
12 | b272a10a4b41a |
13 | 43a60288c4b86 |
14 | 1a9a7d468d286 |
15 | b867c2d1aed7 |
hex | 5af5ac1c4896 |
100011201022102 has 4 divisors (see below), whose sum is σ = 150016801533156. Its totient is φ = 50005600511050.
The previous prime is 100011201022081. The next prime is 100011201022141. The reversal of 100011201022102 is 201220102110001.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1000112010221022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 25002800255524 + ... + 25002800255527.
It is an arithmetic number, because the mean of its divisors is an integer number (37504200383289).
Almost surely, 2100011201022102 is an apocalyptic number.
100011201022102 is a deficient number, since it is larger than the sum of its proper divisors (50005600511054).
100011201022102 is an equidigital number, since it uses as much as digits as its factorization.
100011201022102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50005600511053.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100011201022102 its reverse (201220102110001), we get a palindrome (301231303132103).
The spelling of 100011201022102 in words is "one hundred trillion, eleven billion, two hundred one million, twenty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •