Base | Representation |
---|---|
bin | 11111011011110111010… |
… | …111100111101111010111 |
3 | 21122111220201002112012002 |
4 | 133123313113213233113 |
5 | 240343114234401111 |
6 | 4332220523545515 |
7 | 312033233612000 |
oct | 37336727475727 |
9 | 7574821075162 |
10 | 2160223747031 |
11 | 763166a96449 |
12 | 2aa7ba68b29b |
13 | 128928c8108c |
14 | 767abda81a7 |
15 | 3b2d441563b |
hex | 1f6f75e7bd7 |
2160223747031 has 32 divisors (see below), whose sum is σ = 2626224844800. Its totient is φ = 1774148292000.
The previous prime is 2160223747021. The next prime is 2160223747067. The reversal of 2160223747031 is 1307473220612.
It is not a de Polignac number, because 2160223747031 - 234 = 2143043877847 is a prime.
It is a super-2 number, since 2×21602237470312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2160223747021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 68180 + ... + 2079686.
It is an arithmetic number, because the mean of its divisors is an integer number (82069526400).
Almost surely, 22160223747031 is an apocalyptic number.
2160223747031 is a deficient number, since it is larger than the sum of its proper divisors (466001097769).
2160223747031 is a wasteful number, since it uses less digits than its factorization.
2160223747031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2011660 (or 2011646 counting only the distinct ones).
The product of its (nonzero) digits is 84672, while the sum is 38.
Adding to 2160223747031 its reverse (1307473220612), we get a palindrome (3467696967643).
The spelling of 2160223747031 in words is "two trillion, one hundred sixty billion, two hundred twenty-three million, seven hundred forty-seven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •