Base | Representation |
---|---|
bin | 11000111110110101… |
… | …10000100010011001 |
3 | 1021121201001201010012 |
4 | 30133122300202121 |
5 | 204431433311022 |
6 | 10054505531305 |
7 | 653235130241 |
oct | 143732604231 |
9 | 37551051105 |
10 | 13412010137 |
11 | 57628037a9 |
12 | 27237a3b35 |
13 | 1359859a96 |
14 | 913378b21 |
15 | 5376d8de2 |
hex | 31f6b0899 |
13412010137 has 2 divisors, whose sum is σ = 13412010138. Its totient is φ = 13412010136.
The previous prime is 13412010113. The next prime is 13412010151. The reversal of 13412010137 is 73101021431.
It is a happy number.
13412010137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13027026496 + 384983641 = 114136^2 + 19621^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13412010137 is a prime.
It is not a weakly prime, because it can be changed into another prime (13412010737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6706005068 + 6706005069.
It is an arithmetic number, because the mean of its divisors is an integer number (6706005069).
Almost surely, 213412010137 is an apocalyptic number.
It is an amenable number.
13412010137 is a deficient number, since it is larger than the sum of its proper divisors (1).
13412010137 is an equidigital number, since it uses as much as digits as its factorization.
13412010137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 23.
Adding to 13412010137 its reverse (73101021431), we get a palindrome (86513031568).
The spelling of 13412010137 in words is "thirteen billion, four hundred twelve million, ten thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •