Base | Representation |
---|---|
bin | 11000110011001100… |
… | …00100000010110001 |
3 | 1021100220020001011111 |
4 | 30121212010002301 |
5 | 204231430412241 |
6 | 10041055513321 |
7 | 650640525154 |
oct | 143146040261 |
9 | 37326201144 |
10 | 13314310321 |
11 | 5712643454 |
12 | 26b6b28841 |
13 | 1342540240 |
14 | 9043c5c9b |
15 | 52dd3ac81 |
hex | 3199840b1 |
13314310321 has 16 divisors (see below), whose sum is σ = 14910658560. Its totient is φ = 11804143680.
The previous prime is 13314310309. The next prime is 13314310333. The reversal of 13314310321 is 12301341331.
It is an interprime number because it is at equal distance from previous prime (13314310309) and next prime (13314310333).
It is a cyclic number.
It is not a de Polignac number, because 13314310321 - 213 = 13314302129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13314310292 and 13314310301.
It is not an unprimeable number, because it can be changed into a prime (13314310381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20445 + ... + 164458.
It is an arithmetic number, because the mean of its divisors is an integer number (931916160).
Almost surely, 213314310321 is an apocalyptic number.
It is an amenable number.
13314310321 is a deficient number, since it is larger than the sum of its proper divisors (1596348239).
13314310321 is a wasteful number, since it uses less digits than its factorization.
13314310321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185136.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13314310321 its reverse (12301341331), we get a palindrome (25615651652).
The spelling of 13314310321 in words is "thirteen billion, three hundred fourteen million, three hundred ten thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •