Base | Representation |
---|---|
bin | 101111001000000011… |
… | …1110000110110010010 |
3 | 100200012221210112100210 |
4 | 1132100013300312102 |
5 | 3124230230431002 |
6 | 114254110224550 |
7 | 10211612344416 |
oct | 1362007606622 |
9 | 320187715323 |
10 | 101202202002 |
11 | 39a13006280 |
12 | 177444b5156 |
13 | 970a8c5285 |
14 | 4c809a4d46 |
15 | 2974a5c96c |
hex | 17901f0d92 |
101202202002 has 32 divisors (see below), whose sum is σ = 233793324864. Its totient is φ = 28863372800.
The previous prime is 101202202001. The next prime is 101202202033. The reversal of 101202202002 is 200202202101.
It is a super-2 number, since 2×1012022020022 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101202202001) 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, 45097899 + ... + 45100142.
It is an arithmetic number, because the mean of its divisors is an integer number (7306041402).
Almost surely, 2101202202002 is an apocalyptic number.
101202202002 is an abundant number, since it is smaller than the sum of its proper divisors (132591122862).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101202202002 is a wasteful number, since it uses less digits than its factorization.
101202202002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90198074.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 101202202002 its reverse (200202202101), we get a palindrome (301404404103).
Subtracting 101202202002 from its reverse (200202202101), we obtain a palindrome (99000000099).
It can be divided in two parts, 10120 and 2202002, that added together give a palindrome (2212122).
The spelling of 101202202002 in words is "one hundred one billion, two hundred two million, two hundred two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •