Base | Representation |
---|---|
bin | 10110000000101111100… |
… | …111000000010010011101 |
3 | 12100121100121000111112102 |
4 | 112000233213000102131 |
5 | 144240330033222031 |
6 | 3114520311214445 |
7 | 214166212262411 |
oct | 26005747002235 |
9 | 5317317014472 |
10 | 1512627242141 |
11 | 53355770a2a4 |
12 | 2051a7977425 |
13 | ac8424c4612 |
14 | 532d66c2d41 |
15 | 29530c197cb |
hex | 1602f9c049d |
1512627242141 has 2 divisors, whose sum is σ = 1512627242142. Its totient is φ = 1512627242140.
The previous prime is 1512627242123. The next prime is 1512627242149. The reversal of 1512627242141 is 1412427262151.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1475617562500 + 37009679641 = 1214750^2 + 192379^2 .
It is an emirp because it is prime and its reverse (1412427262151) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1512627242141 - 210 = 1512627241117 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 = 1512627242095 and 1512627242104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1512627242149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 756313621070 + 756313621071.
It is an arithmetic number, because the mean of its divisors is an integer number (756313621071).
Almost surely, 21512627242141 is an apocalyptic number.
It is an amenable number.
1512627242141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1512627242141 is an equidigital number, since it uses as much as digits as its factorization.
1512627242141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 53760, while the sum is 38.
The spelling of 1512627242141 in words is "one trillion, five hundred twelve billion, six hundred twenty-seven million, two hundred forty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •