Base | Representation |
---|---|
bin | 100000000011000011111… |
… | …111010111000101100111 |
3 | 21210112112212110221210020 |
4 | 200003003333113011213 |
5 | 242040313211003221 |
6 | 4403421120530223 |
7 | 315053221135440 |
oct | 40030377270547 |
9 | 7715485427706 |
10 | 2202311422311 |
11 | 779aa4424860 |
12 | 2b69a5780973 |
13 | 12c8a56c7750 |
14 | 788419342c7 |
15 | 3c44932cac6 |
hex | 200c3fd7167 |
2202311422311 has 32 divisors (see below), whose sum is σ = 3942599474688. Its totient is φ = 1056053427840.
The previous prime is 2202311422309. The next prime is 2202311422439. The reversal of 2202311422311 is 1132241132022.
2202311422311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2202311422311 - 21 = 2202311422309 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2202311422301) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 366682216 + ... + 366688221.
It is an arithmetic number, because the mean of its divisors is an integer number (123206233584).
Almost surely, 22202311422311 is an apocalyptic number.
2202311422311 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2202311422311 is a deficient number, since it is larger than the sum of its proper divisors (1740288052377).
2202311422311 is a wasteful number, since it uses less digits than its factorization.
2202311422311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 733370471.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 2202311422311 its reverse (1132241132022), we get a palindrome (3334552554333).
The spelling of 2202311422311 in words is "two trillion, two hundred two billion, three hundred eleven million, four hundred twenty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •