Base | Representation |
---|---|
bin | 11000111000010000… |
… | …11111110000000011 |
3 | 1021110212100101001211 |
4 | 30130020133300003 |
5 | 204323331004024 |
6 | 10045220310551 |
7 | 651665462404 |
oct | 143410376003 |
9 | 37425311054 |
10 | 13356891139 |
11 | 5734687009 |
12 | 2709242457 |
13 | 134b2cb6a7 |
14 | 909d0b9ab |
15 | 53294c594 |
hex | 31c21fc03 |
13356891139 has 2 divisors, whose sum is σ = 13356891140. Its totient is φ = 13356891138.
The previous prime is 13356891127. The next prime is 13356891193. The reversal of 13356891139 is 93119865331.
Together with next prime (13356891193) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13356891139 - 213 = 13356882947 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13356891092 and 13356891101.
It is not a weakly prime, because it can be changed into another prime (13356891239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6678445569 + 6678445570.
It is an arithmetic number, because the mean of its divisors is an integer number (6678445570).
Almost surely, 213356891139 is an apocalyptic number.
13356891139 is a deficient number, since it is larger than the sum of its proper divisors (1).
13356891139 is an equidigital number, since it uses as much as digits as its factorization.
13356891139 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 524880, while the sum is 49.
The spelling of 13356891139 in words is "thirteen billion, three hundred fifty-six million, eight hundred ninety-one thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •