Base | Representation |
---|---|
bin | 1101101111110000100110… |
… | …1110001111110100110101 |
3 | 1222111220021022102021220011 |
4 | 3123330021232033310311 |
5 | 3440112241134024023 |
6 | 52051202425140221 |
7 | 3116650542025036 |
oct | 333741156176465 |
9 | 58456238367804 |
10 | 15114153033013 |
11 | 48a79703a8881 |
12 | 184128332a671 |
13 | 858348c5c668 |
14 | 3a3759486a8d |
15 | 1b324916050d |
hex | dbf09b8fd35 |
15114153033013 has 2 divisors, whose sum is σ = 15114153033014. Its totient is φ = 15114153033012.
The previous prime is 15114153032989. The next prime is 15114153033037. The reversal of 15114153033013 is 31033035141151.
It is a balanced prime because it is at equal distance from previous prime (15114153032989) and next prime (15114153033037).
It can be written as a sum of positive squares in only one way, i.e., 11940079415364 + 3174073617649 = 3455442^2 + 1781593^2 .
It is a cyclic number.
It is not a de Polignac number, because 15114153033013 - 217 = 15114152901941 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15114153033713) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7557076516506 + 7557076516507.
It is an arithmetic number, because the mean of its divisors is an integer number (7557076516507).
Almost surely, 215114153033013 is an apocalyptic number.
It is an amenable number.
15114153033013 is a deficient number, since it is larger than the sum of its proper divisors (1).
15114153033013 is an equidigital number, since it uses as much as digits as its factorization.
15114153033013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8100, while the sum is 31.
Adding to 15114153033013 its reverse (31033035141151), we get a palindrome (46147188174164).
The spelling of 15114153033013 in words is "fifteen trillion, one hundred fourteen billion, one hundred fifty-three million, thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •