Base | Representation |
---|---|
bin | 1101101001011000011111… |
… | …1010010010101110011101 |
3 | 1222010102111102212212202002 |
4 | 3122112013322102232131 |
5 | 3431313410322021031 |
6 | 51525004000212045 |
7 | 3106021666612526 |
oct | 332260772225635 |
9 | 58112442785662 |
10 | 15004600970141 |
11 | 4865463095542 |
12 | 1823baa60a025 |
13 | 84ac0a4b9513 |
14 | 39c32598584d |
15 | 1b0486549ccb |
hex | da587e92b9d |
15004600970141 has 2 divisors, whose sum is σ = 15004600970142. Its totient is φ = 15004600970140.
The previous prime is 15004600970111. The next prime is 15004600970153. The reversal of 15004600970141 is 14107900640051.
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., 9965518826041 + 5039082144100 = 3156821^2 + 2244790^2 .
It is an emirp because it is prime and its reverse (14107900640051) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 15004600970141 - 226 = 15004533861277 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 15004600970095 and 15004600970104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15004600970111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7502300485070 + 7502300485071.
It is an arithmetic number, because the mean of its divisors is an integer number (7502300485071).
Almost surely, 215004600970141 is an apocalyptic number.
It is an amenable number.
15004600970141 is a deficient number, since it is larger than the sum of its proper divisors (1).
15004600970141 is an equidigital number, since it uses as much as digits as its factorization.
15004600970141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30240, while the sum is 38.
The spelling of 15004600970141 in words is "fifteen trillion, four billion, six hundred million, nine hundred seventy thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •