Base | Representation |
---|---|
bin | 11101100011100111000… |
… | …111010101001000100101 |
3 | 21012011121222210021120112 |
4 | 131203213013111020211 |
5 | 231234144104202211 |
6 | 4153024141142405 |
7 | 266512413221411 |
oct | 35434707251045 |
9 | 7164558707515 |
10 | 2031102022181 |
11 | 713427160451 |
12 | 289783b5aa05 |
13 | 1196bc0376ab |
14 | 7043d401d41 |
15 | 37c7873b88b |
hex | 1d8e71d5225 |
2031102022181 has 2 divisors, whose sum is σ = 2031102022182. Its totient is φ = 2031102022180.
The previous prime is 2031102022067. The next prime is 2031102022199. The reversal of 2031102022181 is 1812202011302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1567919691556 + 463182330625 = 1252166^2 + 680575^2 .
It is a cyclic number.
It is not a de Polignac number, because 2031102022181 - 214 = 2031102005797 is a prime.
It is a super-2 number, since 2×20311020221812 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2031102024181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1015551011090 + 1015551011091.
It is an arithmetic number, because the mean of its divisors is an integer number (1015551011091).
Almost surely, 22031102022181 is an apocalyptic number.
It is an amenable number.
2031102022181 is a deficient number, since it is larger than the sum of its proper divisors (1).
2031102022181 is an equidigital number, since it uses as much as digits as its factorization.
2031102022181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 2031102022181 its reverse (1812202011302), we get a palindrome (3843304033483).
The spelling of 2031102022181 in words is "two trillion, thirty-one billion, one hundred two million, twenty-two thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •