Base | Representation |
---|---|
bin | 1101110101100001101111… |
… | …0101101011000001001101 |
3 | 1222212101000221022120212011 |
4 | 3131120123311223001031 |
5 | 3443223204222421401 |
6 | 52204511100541221 |
7 | 3130056204503104 |
oct | 335303365530115 |
9 | 58771027276764 |
10 | 15213241217101 |
11 | 4935999071104 |
12 | 1858517851811 |
13 | 8647aa899455 |
14 | 3a847939303b |
15 | 1b5ae82d7451 |
hex | dd61bd6b04d |
15213241217101 has 2 divisors, whose sum is σ = 15213241217102. Its totient is φ = 15213241217100.
The previous prime is 15213241217029. The next prime is 15213241217117. The reversal of 15213241217101 is 10171214231251.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12894095997225 + 2319145219876 = 3590835^2 + 1522874^2 .
It is an emirp because it is prime and its reverse (10171214231251) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 15213241217101 - 213 = 15213241208909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15213241217191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7606620608550 + 7606620608551.
It is an arithmetic number, because the mean of its divisors is an integer number (7606620608551).
Almost surely, 215213241217101 is an apocalyptic number.
It is an amenable number.
15213241217101 is a deficient number, since it is larger than the sum of its proper divisors (1).
15213241217101 is an equidigital number, since it uses as much as digits as its factorization.
15213241217101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3360, while the sum is 31.
Adding to 15213241217101 its reverse (10171214231251), we get a palindrome (25384455448352).
The spelling of 15213241217101 in words is "fifteen trillion, two hundred thirteen billion, two hundred forty-one million, two hundred seventeen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •