Base | Representation |
---|---|
bin | 1101110001100000110010… |
… | …1010101100100110010101 |
3 | 1222121210000000112201210212 |
4 | 3130120030222230212111 |
5 | 3441110424401030023 |
6 | 52113102540255205 |
7 | 3122065026202622 |
oct | 334301452544625 |
9 | 58553000481725 |
10 | 15144267205013 |
11 | 4909714032a31 |
12 | 1847088541505 |
13 | 85b137b8aa4b |
14 | 3a4db4b31349 |
15 | 1b3e0ccdce78 |
hex | dc60caac995 |
15144267205013 has 2 divisors, whose sum is σ = 15144267205014. Its totient is φ = 15144267205012.
The previous prime is 15144267205009. The next prime is 15144267205049. The reversal of 15144267205013 is 31050276244151.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13534761397444 + 1609505807569 = 3678962^2 + 1268663^2 .
It is a cyclic number.
It is not a de Polignac number, because 15144267205013 - 22 = 15144267205009 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15144267205003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7572133602506 + 7572133602507.
It is an arithmetic number, because the mean of its divisors is an integer number (7572133602507).
Almost surely, 215144267205013 is an apocalyptic number.
It is an amenable number.
15144267205013 is a deficient number, since it is larger than the sum of its proper divisors (1).
15144267205013 is an equidigital number, since it uses as much as digits as its factorization.
15144267205013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 201600, while the sum is 41.
The spelling of 15144267205013 in words is "fifteen trillion, one hundred forty-four billion, two hundred sixty-seven million, two hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •