Base | Representation |
---|---|
bin | 101110101010001110… |
… | …1010000001000101110 |
3 | 100120122012020110210212 |
4 | 1131110131100020232 |
5 | 3120203001432342 |
6 | 114010511302422 |
7 | 10145036110622 |
oct | 1352435201056 |
9 | 316565213725 |
10 | 100201202222 |
11 | 39549a6a330 |
12 | 1750521aa12 |
13 | 95ab3c8004 |
14 | 4bc7a77182 |
15 | 2916c30182 |
hex | 175475022e |
100201202222 has 32 divisors (see below), whose sum is σ = 173633289984. Its totient is φ = 42861232000.
The previous prime is 100201202221. The next prime is 100201202243. The reversal of 100201202222 is 222202102001.
100201202222 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×1002012022223 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100201202197 and 100201202206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100201202221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4233473 + ... + 4257075.
It is an arithmetic number, because the mean of its divisors is an integer number (5426040312).
Almost surely, 2100201202222 is an apocalyptic number.
100201202222 is a deficient number, since it is larger than the sum of its proper divisors (73432087762).
100201202222 is a wasteful number, since it uses less digits than its factorization.
100201202222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34984.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 100201202222 its reverse (222202102001), we get a palindrome (322403304223).
The spelling of 100201202222 in words is "one hundred billion, two hundred one million, two hundred two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •