Base | Representation |
---|---|
bin | 10000001110101101001… |
… | …000110100101100100111 |
3 | 10221121210021011101201202 |
4 | 100032231020310230213 |
5 | 121233114113113111 |
6 | 2212210133313115 |
7 | 143402130432431 |
oct | 20165510645447 |
9 | 3847707141652 |
10 | 1115301301031 |
11 | 39aaa6565a25 |
12 | 1601a019579b |
13 | 81231b89358 |
14 | 3bda371d651 |
15 | 1e028e7eb3b |
hex | 103ad234b27 |
1115301301031 has 2 divisors, whose sum is σ = 1115301301032. Its totient is φ = 1115301301030.
The previous prime is 1115301300991. The next prime is 1115301301111. The reversal of 1115301301031 is 1301031035111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1115301301031 - 210 = 1115301300007 is a prime.
It is a super-2 number, since 2×11153013010312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1115301300994 and 1115301301012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1115301301831) 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, 557650650515 + 557650650516.
It is an arithmetic number, because the mean of its divisors is an integer number (557650650516).
Almost surely, 21115301301031 is an apocalyptic number.
1115301301031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1115301301031 is an equidigital number, since it uses as much as digits as its factorization.
1115301301031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135, while the sum is 20.
Adding to 1115301301031 its reverse (1301031035111), we get a palindrome (2416332336142).
The spelling of 1115301301031 in words is "one trillion, one hundred fifteen billion, three hundred one million, three hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •