Base | Representation |
---|---|
bin | 11000101001010011… |
… | …00001101010111101 |
3 | 1021011010002022100102 |
4 | 30110221201222331 |
5 | 204044210111104 |
6 | 10024533210445 |
7 | 645612316016 |
oct | 142451415275 |
9 | 37133068312 |
10 | 13231332029 |
11 | 567a818653 |
12 | 2693190a25 |
13 | 132b2a9366 |
14 | 8d738600d |
15 | 5268e9a1e |
hex | 314a61abd |
13231332029 has 2 divisors, whose sum is σ = 13231332030. Its totient is φ = 13231332028.
The previous prime is 13231332013. The next prime is 13231332077. The reversal of 13231332029 is 92023313231.
13231332029 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11663568004 + 1567764025 = 107998^2 + 39595^2 .
It is a cyclic number.
It is not a de Polignac number, because 13231332029 - 24 = 13231332013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13231331992 and 13231332010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13231332629) 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, 6615666014 + 6615666015.
It is an arithmetic number, because the mean of its divisors is an integer number (6615666015).
Almost surely, 213231332029 is an apocalyptic number.
It is an amenable number.
13231332029 is a deficient number, since it is larger than the sum of its proper divisors (1).
13231332029 is an equidigital number, since it uses as much as digits as its factorization.
13231332029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 29.
The spelling of 13231332029 in words is "thirteen billion, two hundred thirty-one million, three hundred thirty-two thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •