Base | Representation |
---|---|
bin | 1101101011011001111001… |
… | …1100110000000001010011 |
3 | 1222020202011101022111221002 |
4 | 3122312132130300001103 |
5 | 3432401031220341042 |
6 | 51552551001252215 |
7 | 3111361556623466 |
oct | 332663634600123 |
9 | 58222141274832 |
10 | 15039338840147 |
11 | 4879169778416 |
12 | 182a88419406b |
13 | 85128531159b |
14 | 39dc9d3392dd |
15 | 1b131b09c132 |
hex | dad9e730053 |
15039338840147 has 2 divisors, whose sum is σ = 15039338840148. Its totient is φ = 15039338840146.
The previous prime is 15039338840003. The next prime is 15039338840159. The reversal of 15039338840147 is 74104883393051.
15039338840147 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 15039338840147 - 28 = 15039338839891 is a prime.
It is a super-2 number, since 2×150393388401472 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 15039338840092 and 15039338840101.
It is not a weakly prime, because it can be changed into another prime (15039338848147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7519669420073 + 7519669420074.
It is an arithmetic number, because the mean of its divisors is an integer number (7519669420074).
Almost surely, 215039338840147 is an apocalyptic number.
15039338840147 is a deficient number, since it is larger than the sum of its proper divisors (1).
15039338840147 is an equidigital number, since it uses as much as digits as its factorization.
15039338840147 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8709120, while the sum is 56.
The spelling of 15039338840147 in words is "fifteen trillion, thirty-nine billion, three hundred thirty-eight million, eight hundred forty thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •