Base | Representation |
---|---|
bin | 100000010011101111100… |
… | …000101100110011111001 |
3 | 21212020210001100201002010 |
4 | 200103233200230303321 |
5 | 242334003142422023 |
6 | 4415542231000133 |
7 | 316256104646142 |
oct | 40235740546371 |
9 | 7766701321063 |
10 | 2220221451513 |
11 | 78665514588a |
12 | 2ba363809049 |
13 | 13149b0b6470 |
14 | 79660420ac9 |
15 | 3cb46863093 |
hex | 204ef82ccf9 |
2220221451513 has 64 divisors (see below), whose sum is σ = 3405258823680. Its totient is φ = 1276273152000.
The previous prime is 2220221451443. The next prime is 2220221451517. The reversal of 2220221451513 is 3151541220222.
2220221451513 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 2220221451513 - 28 = 2220221451257 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2220221451517) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 183468163 + ... + 183480263.
It is an arithmetic number, because the mean of its divisors is an integer number (53207169120).
Almost surely, 22220221451513 is an apocalyptic number.
It is an amenable number.
2220221451513 is a deficient number, since it is larger than the sum of its proper divisors (1185037372167).
2220221451513 is a wasteful number, since it uses less digits than its factorization.
2220221451513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17410.
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 2220221451513 its reverse (3151541220222), we get a palindrome (5371762671735).
It can be divided in two parts, 222022 and 1451513, that added together give a triangular number (1673535 = T1829).
The spelling of 2220221451513 in words is "two trillion, two hundred twenty billion, two hundred twenty-one million, four hundred fifty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •