Base | Representation |
---|---|
bin | 1010000000110111111011… |
… | …1110100010011110110111 |
3 | 1102222120001222212100200102 |
4 | 2200031332332202132313 |
5 | 2420342222131044111 |
6 | 35225552400504315 |
7 | 2214312215426123 |
oct | 240157676423667 |
9 | 42876058770612 |
10 | 11010131503031 |
11 | 3565409222111 |
12 | 1299a0691b09b |
13 | 61b33543516b |
14 | 2a0c70d6a583 |
15 | 1415ead9113b |
hex | a037efa27b7 |
11010131503031 has 16 divisors (see below), whose sum is σ = 11588434742784. Its totient is φ = 10440453934944.
The previous prime is 11010131502973. The next prime is 11010131503051. The reversal of 11010131503031 is 13030513101011.
It is a cyclic number.
It is not a de Polignac number, because 11010131503031 - 26 = 11010131502967 is a prime.
It is a super-2 number, since 2×110101315030312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11010131502994 and 11010131503012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010131503051) 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, 2210411 + ... + 5187116.
It is an arithmetic number, because the mean of its divisors is an integer number (724277171424).
Almost surely, 211010131503031 is an apocalyptic number.
11010131503031 is a deficient number, since it is larger than the sum of its proper divisors (578303239753).
11010131503031 is a wasteful number, since it uses less digits than its factorization.
11010131503031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7398110.
The product of its (nonzero) digits is 135, while the sum is 20.
Adding to 11010131503031 its reverse (13030513101011), we get a palindrome (24040644604042).
The spelling of 11010131503031 in words is "eleven trillion, ten billion, one hundred thirty-one million, five hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •