Base | Representation |
---|---|
bin | 101101111110011011011001… |
… | …000100100000110101001101 |
3 | 222111221022222212020110202000 |
4 | 231332123121010200311031 |
5 | 203000334411210400023 |
6 | 1554014211252222513 |
7 | 60406422560215242 |
oct | 5576333104406515 |
9 | 874838885213660 |
10 | 202202112200013 |
11 | 59478485a36482 |
12 | 1a81815a30aa39 |
13 | 88a97676122c3 |
14 | 37d08c4cd95c9 |
15 | 1859b1ab68243 |
hex | b7e6d9120d4d |
202202112200013 has 16 divisors (see below), whose sum is σ = 300801666844800. Its totient is φ = 134242066186560.
The previous prime is 202202112200003. The next prime is 202202112200021. The reversal of 202202112200013 is 310002211202202.
202202112200013 is a `hidden beast` number, since 2 + 0 + 220 + 211 + 220 + 0 + 0 + 13 = 666.
It is not a de Polignac number, because 202202112200013 - 28 = 202202112199757 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202202112200003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15537269673 + ... + 15537282686.
It is an arithmetic number, because the mean of its divisors is an integer number (18800104177800).
Almost surely, 2202202112200013 is an apocalyptic number.
It is an amenable number.
202202112200013 is a deficient number, since it is larger than the sum of its proper divisors (98599554644787).
202202112200013 is a wasteful number, since it uses less digits than its factorization.
202202112200013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31074552609 (or 31074552603 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 202202112200013 its reverse (310002211202202), we get a palindrome (512204323402215).
The spelling of 202202112200013 in words is "two hundred two trillion, two hundred two billion, one hundred twelve million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •