Base | Representation |
---|---|
bin | 10000001010000011000… |
… | …110100110111101110011 |
3 | 10221010212210102101022012 |
4 | 100022003012212331303 |
5 | 121142344041011011 |
6 | 2210022034033135 |
7 | 143134203501413 |
oct | 20120306467563 |
9 | 3833783371265 |
10 | 1110301110131 |
11 | 398970038554 |
12 | 15b2257187ab |
13 | 80915c91905 |
14 | 3ba4b60c643 |
15 | 1dd34edba8b |
hex | 102831a6f73 |
1110301110131 has 2 divisors, whose sum is σ = 1110301110132. Its totient is φ = 1110301110130.
The previous prime is 1110301110103. The next prime is 1110301110143. The reversal of 1110301110131 is 1310111030111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1110301110131 - 26 = 1110301110067 is a prime.
It is a super-2 number, since 2×11103011101312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1110301110151) 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, 555150555065 + 555150555066.
It is an arithmetic number, because the mean of its divisors is an integer number (555150555066).
Almost surely, 21110301110131 is an apocalyptic number.
1110301110131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110301110131 is an equidigital number, since it uses as much as digits as its factorization.
1110301110131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 14.
Adding to 1110301110131 its reverse (1310111030111), we get a palindrome (2420412140242).
The spelling of 1110301110131 in words is "one trillion, one hundred ten billion, three hundred one million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •