Base | Representation |
---|---|
bin | 100000010101011010011… |
… | …011101110110010110111 |
3 | 21212102102001211012201112 |
4 | 200111122123232302313 |
5 | 242401141404423111 |
6 | 4420440231345235 |
7 | 316351416340235 |
oct | 40253233566267 |
9 | 7772361735645 |
10 | 2222015311031 |
11 | 78739579600a |
12 | 2ba78452221b |
13 | 1316c59365b9 |
14 | 79790779955 |
15 | 3cbee0a6e8b |
hex | 2055a6eecb7 |
2222015311031 has 24 divisors (see below), whose sum is σ = 2309749041600. Its totient is φ = 2137236192000.
The previous prime is 2222015311001. The next prime is 2222015311063. The reversal of 2222015311031 is 1301135102222.
It is not a de Polignac number, because 2222015311031 - 218 = 2222015048887 is a prime.
It is a super-2 number, since 2×22220153110312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2222015310988 and 2222015311006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2222015311001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 93080165 + ... + 93104033.
It is an arithmetic number, because the mean of its divisors is an integer number (96239543400).
Almost surely, 22222015311031 is an apocalyptic number.
2222015311031 is a deficient number, since it is larger than the sum of its proper divisors (87733730569).
2222015311031 is an equidigital number, since it uses as much as digits as its factorization.
2222015311031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24731 (or 24690 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 23.
The spelling of 2222015311031 in words is "two trillion, two hundred twenty-two billion, fifteen million, three hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •