Base | Representation |
---|---|
bin | 11110010011111011000001… |
… | …100111111101011011000011 |
3 | 122111000100120000022211211012 |
4 | 132103323001213331123003 |
5 | 114433124242003124024 |
6 | 1151305550001111135 |
7 | 40036235030341061 |
oct | 3623730147753303 |
9 | 574010500284735 |
10 | 133310443411139 |
11 | 39527706a005a5 |
12 | 12b505599284ab |
13 | 5950175731ab7 |
14 | 24cc38d1c1031 |
15 | 1062a9d24550e |
hex | 793ec19fd6c3 |
133310443411139 has 2 divisors, whose sum is σ = 133310443411140. Its totient is φ = 133310443411138.
The previous prime is 133310443411073. The next prime is 133310443411193. The reversal of 133310443411139 is 931114344013331.
Together with next prime (133310443411193) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is an emirp because it is prime and its reverse (931114344013331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133310443411139 - 228 = 133310174975683 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133310443411096 and 133310443411105.
It is not a weakly prime, because it can be changed into another prime (133310443491139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66655221705569 + 66655221705570.
It is an arithmetic number, because the mean of its divisors is an integer number (66655221705570).
Almost surely, 2133310443411139 is an apocalyptic number.
133310443411139 is a deficient number, since it is larger than the sum of its proper divisors (1).
133310443411139 is an equidigital number, since it uses as much as digits as its factorization.
133310443411139 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 139968, while the sum is 41.
The spelling of 133310443411139 in words is "one hundred thirty-three trillion, three hundred ten billion, four hundred forty-three million, four hundred eleven thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •