Base | Representation |
---|---|
bin | 11001011010011011… |
… | …11010101110100101 |
3 | 1022012211200212211211 |
4 | 30231031322232211 |
5 | 210420220300104 |
6 | 10133500031421 |
7 | 662046022621 |
oct | 145515725645 |
9 | 38184625754 |
10 | 13643525029 |
11 | 5871461322 |
12 | 2789232571 |
13 | 13957c9744 |
14 | 936002181 |
15 | 54cbbae04 |
hex | 32d37aba5 |
13643525029 has 2 divisors, whose sum is σ = 13643525030. Its totient is φ = 13643525028.
The previous prime is 13643524969. The next prime is 13643525069. The reversal of 13643525029 is 92052534631.
It is an a-pointer prime, because the next prime (13643525069) can be obtained adding 13643525029 to its sum of digits (40).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13426552129 + 216972900 = 115873^2 + 14730^2 .
It is a cyclic number.
It is not a de Polignac number, because 13643525029 - 213 = 13643516837 is a prime.
It is a super-2 number, since 2×136435250292 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13643524982 and 13643525000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13643525069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6821762514 + 6821762515.
It is an arithmetic number, because the mean of its divisors is an integer number (6821762515).
Almost surely, 213643525029 is an apocalyptic number.
It is an amenable number.
13643525029 is a deficient number, since it is larger than the sum of its proper divisors (1).
13643525029 is an equidigital number, since it uses as much as digits as its factorization.
13643525029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 194400, while the sum is 40.
The spelling of 13643525029 in words is "thirteen billion, six hundred forty-three million, five hundred twenty-five thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •