Base | Representation |
---|---|
bin | 100000000010110010001… |
… | …001100101100110110011 |
3 | 21210111210000021111001110 |
4 | 200002302021211212303 |
5 | 242034210100111311 |
6 | 4403331305404403 |
7 | 315042625064502 |
oct | 40026211454663 |
9 | 7714700244043 |
10 | 2202012113331 |
11 | 779960482568 |
12 | 2b6921499703 |
13 | 12c8586ac344 |
14 | 78813ca0839 |
15 | 3c42ce088a6 |
hex | 200b22659b3 |
2202012113331 has 16 divisors (see below), whose sum is σ = 2985832753920. Its totient is φ = 1443100668000.
The previous prime is 2202012113297. The next prime is 2202012113341. The reversal of 2202012113331 is 1333112102022.
It is not a de Polignac number, because 2202012113331 - 218 = 2202011851187 is a prime.
It is a super-2 number, since 2×22020121133312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2202012113298 and 2202012113307.
It is not an unprimeable number, because it can be changed into a prime (2202012113341) 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, 18641706 + ... + 18759456.
It is an arithmetic number, because the mean of its divisors is an integer number (186614547120).
Almost surely, 22202012113331 is an apocalyptic number.
2202012113331 is a deficient number, since it is larger than the sum of its proper divisors (783820640589).
2202012113331 is a wasteful number, since it uses less digits than its factorization.
2202012113331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223466.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 2202012113331 its reverse (1333112102022), we get a palindrome (3535124215353).
The spelling of 2202012113331 in words is "two trillion, two hundred two billion, twelve million, one hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.727 sec. • engine limits •