Base | Representation |
---|---|
bin | 10000001001111001000… |
… | …010101001110011010101 |
3 | 10221010110000202222201122 |
4 | 100021321002221303111 |
5 | 121142022332113023 |
6 | 2205553203533325 |
7 | 143130053602511 |
oct | 20117102516325 |
9 | 3833400688648 |
10 | 1110132301013 |
11 | 39889381978a |
12 | 15b19908a245 |
13 | 808ba008668 |
14 | 3ba33029141 |
15 | 1dd252942c8 |
hex | 102790a9cd5 |
1110132301013 has 2 divisors, whose sum is σ = 1110132301014. Its totient is φ = 1110132301012.
The previous prime is 1110132300973. The next prime is 1110132301039. The reversal of 1110132301013 is 3101032310111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 888462711889 + 221669589124 = 942583^2 + 470818^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110132301013 - 222 = 1110128106709 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1110132300982 and 1110132301000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110132301913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555066150506 + 555066150507.
It is an arithmetic number, because the mean of its divisors is an integer number (555066150507).
Almost surely, 21110132301013 is an apocalyptic number.
It is an amenable number.
1110132301013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110132301013 is an equidigital number, since it uses as much as digits as its factorization.
1110132301013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1110132301013 its reverse (3101032310111), we get a palindrome (4211164611124).
The spelling of 1110132301013 in words is "one trillion, one hundred ten billion, one hundred thirty-two million, three hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •