Base | Representation |
---|---|
bin | 11110101110011111011… |
… | …110011100101010100101 |
3 | 21110212011101020102021201 |
4 | 132232133132130222211 |
5 | 234043330123021123 |
6 | 4254002313242501 |
7 | 305360023062016 |
oct | 36563736345245 |
9 | 7425141212251 |
10 | 2111504501413 |
11 | 74453627609a |
12 | 2a1282703431 |
13 | 12416366b3a8 |
14 | 742a97c900d |
15 | 39dd220d5ad |
hex | 1eb9f79caa5 |
2111504501413 has 2 divisors, whose sum is σ = 2111504501414. Its totient is φ = 2111504501412.
The previous prime is 2111504501401. The next prime is 2111504501417. The reversal of 2111504501413 is 3141054051112.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1233792220644 + 877712280769 = 1110762^2 + 936863^2 .
It is a cyclic number.
It is not a de Polignac number, because 2111504501413 - 213 = 2111504493221 is a prime.
It is a super-3 number, since 3×21115045014133 (a number of 38 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2111504501417) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055752250706 + 1055752250707.
It is an arithmetic number, because the mean of its divisors is an integer number (1055752250707).
Almost surely, 22111504501413 is an apocalyptic number.
It is an amenable number.
2111504501413 is a deficient number, since it is larger than the sum of its proper divisors (1).
2111504501413 is an equidigital number, since it uses as much as digits as its factorization.
2111504501413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 2111504501413 its reverse (3141054051112), we get a palindrome (5252558552525).
The spelling of 2111504501413 in words is "two trillion, one hundred eleven billion, five hundred four million, five hundred one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •