Base | Representation |
---|---|
bin | 1010000001100000111010… |
… | …1010000111011100111011 |
3 | 1110000121110122020122221001 |
4 | 2200120032222013130323 |
5 | 2421032234243100011 |
6 | 35235012123425431 |
7 | 2215151632224025 |
oct | 240301652073473 |
9 | 43017418218831 |
10 | 11021132003131 |
11 | 356a043771708 |
12 | 129bb76985277 |
13 | 61c3994a6313 |
14 | 2a15d5d2b015 |
15 | 141a419cd7c1 |
hex | a060ea8773b |
11021132003131 has 2 divisors, whose sum is σ = 11021132003132. Its totient is φ = 11021132003130.
The previous prime is 11021132003093. The next prime is 11021132003171. The reversal of 11021132003131 is 13130023112011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11021132003131 - 27 = 11021132003003 is a prime.
It is a super-2 number, since 2×110211320031312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11021132003099 and 11021132003108.
It is not a weakly prime, because it can be changed into another prime (11021132003171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510566001565 + 5510566001566.
It is an arithmetic number, because the mean of its divisors is an integer number (5510566001566).
Almost surely, 211021132003131 is an apocalyptic number.
11021132003131 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021132003131 is an equidigital number, since it uses as much as digits as its factorization.
11021132003131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 11021132003131 its reverse (13130023112011), we get a palindrome (24151155115142).
The spelling of 11021132003131 in words is "eleven trillion, twenty-one billion, one hundred thirty-two million, three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •