Base | Representation |
---|---|
bin | 11001000100101100… |
… | …11110110001001101 |
3 | 1021202010122211221121 |
4 | 30202112132301031 |
5 | 210032033023204 |
6 | 10103424400541 |
7 | 654403325416 |
oct | 144226366115 |
9 | 37663584847 |
10 | 13461220429 |
11 | 5788565168 |
12 | 2738176151 |
13 | 1366ac98b7 |
14 | 919b0880d |
15 | 53bba9b54 |
hex | 32259ec4d |
13461220429 has 2 divisors, whose sum is σ = 13461220430. Its totient is φ = 13461220428.
The previous prime is 13461220393. The next prime is 13461220433. The reversal of 13461220429 is 92402216431.
13461220429 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., 12667502500 + 793717929 = 112550^2 + 28173^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13461220429 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13461220394 and 13461220403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13461221429) 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, 6730610214 + 6730610215.
It is an arithmetic number, because the mean of its divisors is an integer number (6730610215).
Almost surely, 213461220429 is an apocalyptic number.
It is an amenable number.
13461220429 is a deficient number, since it is larger than the sum of its proper divisors (1).
13461220429 is an equidigital number, since it uses as much as digits as its factorization.
13461220429 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 34.
The spelling of 13461220429 in words is "thirteen billion, four hundred sixty-one million, two hundred twenty thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •