Base | Representation |
---|---|
bin | 11000011010110000… |
… | …10000100011100111 |
3 | 1020211121120201222211 |
4 | 30031120100203213 |
5 | 203321444134332 |
6 | 10004455104251 |
7 | 642601522636 |
oct | 141530204347 |
9 | 36747521884 |
10 | 13109364967 |
11 | 5617992a26 |
12 | 265a372087 |
13 | 130bc43cba |
14 | 8c50b751d |
15 | 51ad56447 |
hex | 30d6108e7 |
13109364967 has 2 divisors, whose sum is σ = 13109364968. Its totient is φ = 13109364966.
The previous prime is 13109364959. The next prime is 13109365007. The reversal of 13109364967 is 76946390131.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13109364967 - 23 = 13109364959 is a prime.
It is a super-2 number, since 2×131093649672 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13109364967.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13109365967) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6554682483 + 6554682484.
It is an arithmetic number, because the mean of its divisors is an integer number (6554682484).
Almost surely, 213109364967 is an apocalyptic number.
13109364967 is a deficient number, since it is larger than the sum of its proper divisors (1).
13109364967 is an equidigital number, since it uses as much as digits as its factorization.
13109364967 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 734832, while the sum is 49.
The spelling of 13109364967 in words is "thirteen billion, one hundred nine million, three hundred sixty-four thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •