Base | Representation |
---|---|
bin | 10110110010000111100011… |
… | …100100010101101000101110 |
3 | 111010210010120122021011120112 |
4 | 112302013203210111220232 |
5 | 101113143333130032342 |
6 | 553035430544020022 |
7 | 30051201626021315 |
oct | 2662074344255056 |
9 | 433703518234515 |
10 | 100201110002222 |
11 | 29a220633a4489 |
12 | b2a3791001612 |
13 | 43bac02408668 |
14 | 1aa5a8c4b727c |
15 | b8b6da403682 |
hex | 5b21e3915a2e |
100201110002222 has 8 divisors (see below), whose sum is σ = 153137545475256. Its totient is φ = 49155261510472.
The previous prime is 100201110002177. The next prime is 100201110002251. The reversal of 100201110002222 is 222200011102001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 100201110002197 and 100201110002206.
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 in 3 ways as a sum of consecutive naturals, for example, 472646745188 + ... + 472646745399.
It is an arithmetic number, because the mean of its divisors is an integer number (19142193184407).
Almost surely, 2100201110002222 is an apocalyptic number.
100201110002222 is a deficient number, since it is larger than the sum of its proper divisors (52936435473034).
100201110002222 is an equidigital number, since it uses as much as digits as its factorization.
100201110002222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 945293490642.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 100201110002222 its reverse (222200011102001), we get a palindrome (322401121104223).
The spelling of 100201110002222 in words is "one hundred trillion, two hundred one billion, one hundred ten million, two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •