Base | Representation |
---|---|
bin | 11000110100000011… |
… | …00001110010001111 |
3 | 1021101101202211022102 |
4 | 30122001201302033 |
5 | 204240301310111 |
6 | 10041514105315 |
7 | 651055652444 |
oct | 143201416217 |
9 | 37341684272 |
10 | 13321510031 |
11 | 5716710725 |
12 | 26b941b23b |
13 | 1343b9131b |
14 | 90533b9cb |
15 | 52e7ae13b |
hex | 31a061c8f |
13321510031 has 2 divisors, whose sum is σ = 13321510032. Its totient is φ = 13321510030.
The previous prime is 13321510019. The next prime is 13321510051. The reversal of 13321510031 is 13001512331.
It is an a-pointer prime, because the next prime (13321510051) can be obtained adding 13321510031 to its sum of digits (20).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13321510031 - 26 = 13321509967 is a prime.
It is a super-2 number, since 2×133215100312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13321509985 and 13321510012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13321510051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660755015 + 6660755016.
It is an arithmetic number, because the mean of its divisors is an integer number (6660755016).
Almost surely, 213321510031 is an apocalyptic number.
13321510031 is a deficient number, since it is larger than the sum of its proper divisors (1).
13321510031 is an equidigital number, since it uses as much as digits as its factorization.
13321510031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 20.
The spelling of 13321510031 in words is "thirteen billion, three hundred twenty-one million, five hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •