Base | Representation |
---|---|
bin | 10111001111001110001100… |
… | …110111101010110110101011 |
3 | 111101212022221002111200022120 |
4 | 113033032030313222312223 |
5 | 101343430333203241021 |
6 | 1001210313013322323 |
7 | 30345533533222116 |
oct | 2717161467526653 |
9 | 441768832450276 |
10 | 102201110212011 |
11 | 2a62327a378948 |
12 | b5673150363a3 |
13 | 45046a5a14365 |
14 | 1b347badbd57d |
15 | bc37434232c6 |
hex | 5cf38cdeadab |
102201110212011 has 32 divisors (see below), whose sum is σ = 146198462699520. Its totient is φ = 63347547225600.
The previous prime is 102201110211971. The next prime is 102201110212031. The reversal of 102201110212011 is 110212011102201.
It is a happy number.
It is not a de Polignac number, because 102201110212011 - 215 = 102201110179243 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102201110212031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 65886906 + ... + 67420223.
It is an arithmetic number, because the mean of its divisors is an integer number (4568701959360).
Almost surely, 2102201110212011 is an apocalyptic number.
102201110212011 is a deficient number, since it is larger than the sum of its proper divisors (43997352487509).
102201110212011 is a wasteful number, since it uses less digits than its factorization.
102201110212011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133307467.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 102201110212011 its reverse (110212011102201), we get a palindrome (212413121314212).
It can be divided in two parts, 102201 and 110212011, that multiplied together give a palindrome (11263777736211).
The spelling of 102201110212011 in words is "one hundred two trillion, two hundred one billion, one hundred ten million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •