Base | Representation |
---|---|
bin | 11000111110110101… |
… | …10000100010000001 |
3 | 1021121201001201002022 |
4 | 30133122300202001 |
5 | 204431433310423 |
6 | 10054505531225 |
7 | 653235130205 |
oct | 143732604201 |
9 | 37551051068 |
10 | 13412010113 |
11 | 5762803787 |
12 | 27237a3b15 |
13 | 1359859a78 |
14 | 913378b05 |
15 | 5376d8dc8 |
hex | 31f6b0881 |
13412010113 has 2 divisors, whose sum is σ = 13412010114. Its totient is φ = 13412010112.
The previous prime is 13412010091. The next prime is 13412010137. The reversal of 13412010113 is 31101021431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10897689664 + 2514320449 = 104392^2 + 50143^2 .
It is a cyclic number.
It is not a de Polignac number, because 13412010113 - 210 = 13412009089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13412010091 and 13412010100.
It is not a weakly prime, because it can be changed into another prime (13412010163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6706005056 + 6706005057.
It is an arithmetic number, because the mean of its divisors is an integer number (6706005057).
Almost surely, 213412010113 is an apocalyptic number.
It is an amenable number.
13412010113 is a deficient number, since it is larger than the sum of its proper divisors (1).
13412010113 is an equidigital number, since it uses as much as digits as its factorization.
13412010113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 13412010113 its reverse (31101021431), we get a palindrome (44513031544).
The spelling of 13412010113 in words is "thirteen billion, four hundred twelve million, ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •