Base | Representation |
---|---|
bin | 100000010011101010001… |
… | …101001001101010011011 |
3 | 21212020112211212111020111 |
4 | 200103222031021222123 |
5 | 242333312401100411 |
6 | 4415525331105151 |
7 | 316253644243402 |
oct | 40235215115233 |
9 | 7766484774214 |
10 | 2220132440731 |
11 | 78660997a757 |
12 | 2ba339a421b7 |
13 | 13148581c86a |
14 | 79652690639 |
15 | 3cb3db2e721 |
hex | 204ea349a9b |
2220132440731 has 2 divisors, whose sum is σ = 2220132440732. Its totient is φ = 2220132440730.
The previous prime is 2220132440629. The next prime is 2220132440783. The reversal of 2220132440731 is 1370442310222.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2220132440731 - 211 = 2220132438683 is a prime.
It is a super-2 number, since 2×22201324407312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2220132440693 and 2220132440702.
It is not a weakly prime, because it can be changed into another prime (2220132440791) 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, 1110066220365 + 1110066220366.
It is an arithmetic number, because the mean of its divisors is an integer number (1110066220366).
Almost surely, 22220132440731 is an apocalyptic number.
2220132440731 is a deficient number, since it is larger than the sum of its proper divisors (1).
2220132440731 is an equidigital number, since it uses as much as digits as its factorization.
2220132440731 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 31.
Adding to 2220132440731 its reverse (1370442310222), we get a palindrome (3590574750953).
The spelling of 2220132440731 in words is "two trillion, two hundred twenty billion, one hundred thirty-two million, four hundred forty thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •