Base | Representation |
---|---|
bin | 1001001001010111011001… |
… | …11000100100001100010001 |
3 | 2122012210012022211210102212 |
4 | 10210223230320210030101 |
5 | 10114012421322144103 |
6 | 110435442330521505 |
7 | 4144055110545233 |
oct | 444535470441421 |
9 | 78183168753385 |
10 | 20113011131153 |
11 | 6454975490596 |
12 | 230a052896295 |
13 | b2b858591845 |
14 | 4d7691304253 |
15 | 24d2bb4c07d8 |
hex | 124aece24311 |
20113011131153 has 2 divisors, whose sum is σ = 20113011131154. Its totient is φ = 20113011131152.
The previous prime is 20113011131117. The next prime is 20113011131167. The reversal of 20113011131153 is 35113111031102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20079782216209 + 33228914944 = 4481047^2 + 182288^2 .
It is a cyclic number.
It is not a de Polignac number, because 20113011131153 - 28 = 20113011130897 is a prime.
It is not a weakly prime, because it can be changed into another prime (20113011131053) 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, 10056505565576 + 10056505565577.
It is an arithmetic number, because the mean of its divisors is an integer number (10056505565577).
Almost surely, 220113011131153 is an apocalyptic number.
It is an amenable number.
20113011131153 is a deficient number, since it is larger than the sum of its proper divisors (1).
20113011131153 is an equidigital number, since it uses as much as digits as its factorization.
20113011131153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 23.
Adding to 20113011131153 its reverse (35113111031102), we get a palindrome (55226122162255).
The spelling of 20113011131153 in words is "twenty trillion, one hundred thirteen billion, eleven million, one hundred thirty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •