Base | Representation |
---|---|
bin | 10111001111001111001001… |
… | …001100000110010000100101 |
3 | 111101212102112121201222222221 |
4 | 113033033021030012100211 |
5 | 101343434421240400401 |
6 | 1001211001243552341 |
7 | 30345600602042530 |
oct | 2717171114062045 |
9 | 441772477658887 |
10 | 102202122200101 |
11 | 2a62374963a540 |
12 | b567557b2b6b1 |
13 | 450480758ac91 |
14 | 1b3487556ba17 |
15 | bc37a21c17a1 |
hex | 5cf3c9306425 |
102202122200101 has 128 divisors (see below), whose sum is σ = 130265626263552. Its totient is φ = 77888079360000.
The previous prime is 102202122200089. The next prime is 102202122200153. The reversal of 102202122200101 is 101002221202201.
It is a happy number.
It is not a de Polignac number, because 102202122200101 - 29 = 102202122199589 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102202122200161) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 208150961466 + ... + 208150961956.
It is an arithmetic number, because the mean of its divisors is an integer number (1017700205184).
Almost surely, 2102202122200101 is an apocalyptic number.
102202122200101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102202122200101 is a deficient number, since it is larger than the sum of its proper divisors (28063504063451).
102202122200101 is a wasteful number, since it uses less digits than its factorization.
102202122200101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1523.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 102202122200101 its reverse (101002221202201), we get a palindrome (203204343402302).
The spelling of 102202122200101 in words is "one hundred two trillion, two hundred two billion, one hundred twenty-two million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •