Base | Representation |
---|---|
bin | 1011111011010101111111… |
… | …0101011111110011010011 |
3 | 1201102200220011201102120012 |
4 | 2332311133311133303103 |
5 | 3204330231102422344 |
6 | 43520315405305135 |
7 | 2522315455251221 |
oct | 276653765376323 |
9 | 51380804642505 |
10 | 13114143014099 |
11 | 41a67499346a6 |
12 | 1579737b651ab |
13 | 7418735cac4a |
14 | 334a29549b11 |
15 | 17b1e035429e |
hex | bed5fd5fcd3 |
13114143014099 has 2 divisors, whose sum is σ = 13114143014100. Its totient is φ = 13114143014098.
The previous prime is 13114143014057. The next prime is 13114143014107. The reversal of 13114143014099 is 99041034141131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13114143014099 - 240 = 12014631386323 is a prime.
It is not a weakly prime, because it can be changed into another prime (13114143010099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6557071507049 + 6557071507050.
It is an arithmetic number, because the mean of its divisors is an integer number (6557071507050).
Almost surely, 213114143014099 is an apocalyptic number.
13114143014099 is a deficient number, since it is larger than the sum of its proper divisors (1).
13114143014099 is an equidigital number, since it uses as much as digits as its factorization.
13114143014099 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 41.
The spelling of 13114143014099 in words is "thirteen trillion, one hundred fourteen billion, one hundred forty-three million, fourteen thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •