Base | Representation |
---|---|
bin | 11001001001110111… |
… | …11101111111111011 |
3 | 1021212011021212102102 |
4 | 30210323331333323 |
5 | 210124134231412 |
6 | 10112014254015 |
7 | 655441136543 |
oct | 144473757773 |
9 | 37764255372 |
10 | 13504602107 |
11 | 57aaaa5497 |
12 | 274a7b730b |
13 | 1372aa8729 |
14 | 92179c323 |
15 | 5408c88c2 |
hex | 324efdffb |
13504602107 has 2 divisors, whose sum is σ = 13504602108. Its totient is φ = 13504602106.
The previous prime is 13504601993. The next prime is 13504602109. The reversal of 13504602107 is 70120640531.
It is a strong prime.
It is an emirp because it is prime and its reverse (70120640531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13504602107 - 228 = 13236166651 is a prime.
Together with 13504602109, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13504602107.
It is not a weakly prime, because it can be changed into another prime (13504602109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6752301053 + 6752301054.
It is an arithmetic number, because the mean of its divisors is an integer number (6752301054).
Almost surely, 213504602107 is an apocalyptic number.
13504602107 is a deficient number, since it is larger than the sum of its proper divisors (1).
13504602107 is an equidigital number, since it uses as much as digits as its factorization.
13504602107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 29.
The spelling of 13504602107 in words is "thirteen billion, five hundred four million, six hundred two thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •