Base | Representation |
---|---|
bin | 1110000101101010010110… |
… | …1000010110010011000111 |
3 | 2000211212111202120210100121 |
4 | 3201122211220112103013 |
5 | 4012243400301341421 |
6 | 52540112233322411 |
7 | 3156101214020605 |
oct | 341324550262307 |
9 | 60755452523317 |
10 | 15490430887111 |
11 | 4a32500445914 |
12 | 18a2195b66407 |
13 | 884983a1737b |
14 | 3b7a52c9a875 |
15 | 1bce1d14ed41 |
hex | e16a5a164c7 |
15490430887111 has 2 divisors, whose sum is σ = 15490430887112. Its totient is φ = 15490430887110.
The previous prime is 15490430887039. The next prime is 15490430887163. The reversal of 15490430887111 is 11178803409451.
It is an a-pointer prime, because the next prime (15490430887163) can be obtained adding 15490430887111 to its sum of digits (52).
It is a strong prime.
It is an emirp because it is prime and its reverse (11178803409451) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 15490430887111 - 29 = 15490430886599 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15490430881111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7745215443555 + 7745215443556.
It is an arithmetic number, because the mean of its divisors is an integer number (7745215443556).
Almost surely, 215490430887111 is an apocalyptic number.
15490430887111 is a deficient number, since it is larger than the sum of its proper divisors (1).
15490430887111 is an equidigital number, since it uses as much as digits as its factorization.
15490430887111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 967680, while the sum is 52.
The spelling of 15490430887111 in words is "fifteen trillion, four hundred ninety billion, four hundred thirty million, eight hundred eighty-seven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •