Base | Representation |
---|---|
bin | 1101110101011101111010… |
… | …1000001110111100010101 |
3 | 1222212021101100221222112211 |
4 | 3131113132220032330111 |
5 | 3443214103324042203 |
6 | 52204221134113421 |
7 | 3130021564636153 |
oct | 335273650167425 |
9 | 58767340858484 |
10 | 15212214284053 |
11 | 4935511422106 |
12 | 185828b94b871 |
13 | 864675bbc267 |
14 | 3a83bcc343d3 |
15 | 1b5a88085c6d |
hex | dd5dea0ef15 |
15212214284053 has 2 divisors, whose sum is σ = 15212214284054. Its totient is φ = 15212214284052.
The previous prime is 15212214284023. The next prime is 15212214284117. The reversal of 15212214284053 is 35048241221251.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12979721096644 + 2232493187409 = 3602738^2 + 1494153^2 .
It is a cyclic number.
It is not a de Polignac number, because 15212214284053 - 213 = 15212214275861 is a prime.
It is a super-2 number, since 2×152122142840532 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 15212214283997 and 15212214284015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15212214284023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7606107142026 + 7606107142027.
It is an arithmetic number, because the mean of its divisors is an integer number (7606107142027).
Almost surely, 215212214284053 is an apocalyptic number.
It is an amenable number.
15212214284053 is a deficient number, since it is larger than the sum of its proper divisors (1).
15212214284053 is an equidigital number, since it uses as much as digits as its factorization.
15212214284053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 153600, while the sum is 40.
The spelling of 15212214284053 in words is "fifteen trillion, two hundred twelve billion, two hundred fourteen million, two hundred eighty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •