Base | Representation |
---|---|
bin | 11000001111011100… |
… | …11110000010010101 |
3 | 1020121000010022201101 |
4 | 30013232132002111 |
5 | 203123204232203 |
6 | 5551230230101 |
7 | 640340425546 |
oct | 140756360225 |
9 | 36530108641 |
10 | 13014524053 |
11 | 55793a5603 |
12 | 2632655331 |
13 | 12c53b880b |
14 | 8b666a4cd |
15 | 51287041d |
hex | 307b9e095 |
13014524053 has 2 divisors, whose sum is σ = 13014524054. Its totient is φ = 13014524052.
The previous prime is 13014524011. The next prime is 13014524057. The reversal of 13014524053 is 35042541031.
13014524053 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 can be written as a sum of positive squares in only one way, i.e., 8226852804 + 4787671249 = 90702^2 + 69193^2 .
It is a cyclic number.
It is not a de Polignac number, because 13014524053 - 217 = 13014392981 is a prime.
It is a super-2 number, since 2×130145240532 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13014524057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6507262026 + 6507262027.
It is an arithmetic number, because the mean of its divisors is an integer number (6507262027).
Almost surely, 213014524053 is an apocalyptic number.
It is an amenable number.
13014524053 is a deficient number, since it is larger than the sum of its proper divisors (1).
13014524053 is an equidigital number, since it uses as much as digits as its factorization.
13014524053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7200, while the sum is 28.
The spelling of 13014524053 in words is "thirteen billion, fourteen million, five hundred twenty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •