Base | Representation |
---|---|
bin | 1001001010100110011000… |
… | …00111010001011000111011 |
3 | 2122100211122020200212100222 |
4 | 10211103030013101120323 |
5 | 10120211240204324011 |
6 | 110511133515250255 |
7 | 4150115605562534 |
oct | 445231407213073 |
9 | 78324566625328 |
10 | 20155411011131 |
11 | 6470953079a10 |
12 | 231630644998b |
13 | b328548ba216 |
14 | 4d97544dd68b |
15 | 24e44da07ddb |
hex | 1254cc1d163b |
20155411011131 has 16 divisors (see below), whose sum is σ = 23145533308800. Its totient is φ = 17358304392000.
The previous prime is 20155411011119. The next prime is 20155411011161. The reversal of 20155411011131 is 13111011455102.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-20155411011131 is a prime.
It is a super-2 number, since 2×201554110111312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20155411011131.
It is not an unprimeable number, because it can be changed into a prime (20155411011101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7582880 + ... + 9889938.
It is an arithmetic number, because the mean of its divisors is an integer number (1446595831800).
Almost surely, 220155411011131 is an apocalyptic number.
20155411011131 is a deficient number, since it is larger than the sum of its proper divisors (2990122297669).
20155411011131 is a wasteful number, since it uses less digits than its factorization.
20155411011131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2348890.
The product of its (nonzero) digits is 600, while the sum is 26.
Adding to 20155411011131 its reverse (13111011455102), we get a palindrome (33266422466233).
The spelling of 20155411011131 in words is "twenty trillion, one hundred fifty-five billion, four hundred eleven million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •