Base | Representation |
---|---|
bin | 100000010011101010000… |
… | …100011100111100101101 |
3 | 21212020112200120122020212 |
4 | 200103222010130330231 |
5 | 242333311310113204 |
6 | 4415525210152205 |
7 | 316253615665316 |
oct | 40235204347455 |
9 | 7766480518225 |
10 | 2220130160429 |
11 | 786608662505 |
12 | 2ba339122665 |
13 | 13148520197c |
14 | 7965225960d |
15 | 3cb3d82dc6e |
hex | 204ea11cf2d |
2220130160429 has 2 divisors, whose sum is σ = 2220130160430. Its totient is φ = 2220130160428.
The previous prime is 2220130160401. The next prime is 2220130160453. The reversal of 2220130160429 is 9240610310222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1875680898025 + 344449262404 = 1369555^2 + 586898^2 .
It is a cyclic number.
It is not a de Polignac number, because 2220130160429 - 28 = 2220130160173 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2220130160395 and 2220130160404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2220130160489) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1110065080214 + 1110065080215.
It is an arithmetic number, because the mean of its divisors is an integer number (1110065080215).
Almost surely, 22220130160429 is an apocalyptic number.
It is an amenable number.
2220130160429 is a deficient number, since it is larger than the sum of its proper divisors (1).
2220130160429 is an equidigital number, since it uses as much as digits as its factorization.
2220130160429 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 32.
The spelling of 2220130160429 in words is "two trillion, two hundred twenty billion, one hundred thirty million, one hundred sixty thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •