Base | Representation |
---|---|
bin | 11000111001101010… |
… | …00001100110110111 |
3 | 1021111200022102102121 |
4 | 30130311001212313 |
5 | 204334323023101 |
6 | 10050314420411 |
7 | 652166630455 |
oct | 143465014667 |
9 | 37450272377 |
10 | 13368564151 |
11 | 574022a128 |
12 | 2711131707 |
13 | 13508578b7 |
14 | 90b6a99d5 |
15 | 5339a60a1 |
hex | 31cd419b7 |
13368564151 has 2 divisors, whose sum is σ = 13368564152. Its totient is φ = 13368564150.
The previous prime is 13368564119. The next prime is 13368564161. The reversal of 13368564151 is 15146586331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13368564151 - 25 = 13368564119 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13368564098 and 13368564107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13368564161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6684282075 + 6684282076.
It is an arithmetic number, because the mean of its divisors is an integer number (6684282076).
Almost surely, 213368564151 is an apocalyptic number.
13368564151 is a deficient number, since it is larger than the sum of its proper divisors (1).
13368564151 is an equidigital number, since it uses as much as digits as its factorization.
13368564151 is an evil number, because the sum of its binary digits is even.
The product of its digits is 259200, while the sum is 43.
The spelling of 13368564151 in words is "thirteen billion, three hundred sixty-eight million, five hundred sixty-four thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •