Base | Representation |
---|---|
bin | 11101011011111010110… |
… | …10111000010110011101 |
3 | 10120200122201000102000101 |
4 | 32231331122320112131 |
5 | 113032342401404432 |
6 | 2052350213101101 |
7 | 133033653004051 |
oct | 16557532702635 |
9 | 3520581012011 |
10 | 1011421513117 |
11 | 35aa3a092834 |
12 | 14402b027791 |
13 | 744b8627822 |
14 | 36d4b2bbc61 |
15 | 1b4993184e7 |
hex | eb7d6b859d |
1011421513117 has 2 divisors, whose sum is σ = 1011421513118. Its totient is φ = 1011421513116.
The previous prime is 1011421513027. The next prime is 1011421513147. The reversal of 1011421513117 is 7113151241101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 819425058841 + 191996454276 = 905221^2 + 438174^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011421513117 - 211 = 1011421511069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011421513147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505710756558 + 505710756559.
It is an arithmetic number, because the mean of its divisors is an integer number (505710756559).
Almost surely, 21011421513117 is an apocalyptic number.
It is an amenable number.
1011421513117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011421513117 is an equidigital number, since it uses as much as digits as its factorization.
1011421513117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840, while the sum is 28.
Adding to 1011421513117 its reverse (7113151241101), we get a palindrome (8124572754218).
The spelling of 1011421513117 in words is "one trillion, eleven billion, four hundred twenty-one million, five hundred thirteen thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •