Base | Representation |
---|---|
bin | 11000111001010110… |
… | …11100100010010011 |
3 | 1021111111120211210102 |
4 | 30130223130202103 |
5 | 204333202144021 |
6 | 10050144523015 |
7 | 652136401403 |
oct | 143453344223 |
9 | 37444524712 |
10 | 13366053011 |
11 | 5739874503 |
12 | 271032046b |
13 | 135018890c |
14 | 90b214803 |
15 | 53365c00b |
hex | 31cadc893 |
13366053011 has 2 divisors, whose sum is σ = 13366053012. Its totient is φ = 13366053010.
The previous prime is 13366053007. The next prime is 13366053037. The reversal of 13366053011 is 11035066331.
13366053011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (11035066331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13366053011 - 22 = 13366053007 is a prime.
It is a super-2 number, since 2×133660530112 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13366053611) 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, 6683026505 + 6683026506.
It is an arithmetic number, because the mean of its divisors is an integer number (6683026506).
Almost surely, 213366053011 is an apocalyptic number.
13366053011 is a deficient number, since it is larger than the sum of its proper divisors (1).
13366053011 is an equidigital number, since it uses as much as digits as its factorization.
13366053011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 29.
The spelling of 13366053011 in words is "thirteen billion, three hundred sixty-six million, fifty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •