Base | Representation |
---|---|
bin | 11110010100000100000001… |
… | …010101100010010111010011 |
3 | 122111001021111011011002222222 |
4 | 132110010001111202113103 |
5 | 114433304032134230011 |
6 | 1151314224235451255 |
7 | 40040026263233615 |
oct | 3624040125422723 |
9 | 574037434132888 |
10 | 133320102258131 |
11 | 39530813093278 |
12 | 12b523b45b6b2b |
13 | 5951054842b89 |
14 | 24cca27cdadb5 |
15 | 1062e661b5ddb |
hex | 7941015625d3 |
133320102258131 has 2 divisors, whose sum is σ = 133320102258132. Its totient is φ = 133320102258130.
The previous prime is 133320102258121. The next prime is 133320102258143. The reversal of 133320102258131 is 131852201023331.
It is a weak prime.
It is an emirp because it is prime and its reverse (131852201023331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133320102258131 - 226 = 133320035149267 is a prime.
It is a super-2 number, since 2×1333201022581312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133320102258091 and 133320102258100.
It is not a weakly prime, because it can be changed into another prime (133320102258121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66660051129065 + 66660051129066.
It is an arithmetic number, because the mean of its divisors is an integer number (66660051129066).
Almost surely, 2133320102258131 is an apocalyptic number.
133320102258131 is a deficient number, since it is larger than the sum of its proper divisors (1).
133320102258131 is an equidigital number, since it uses as much as digits as its factorization.
133320102258131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25920, while the sum is 35.
The spelling of 133320102258131 in words is "one hundred thirty-three trillion, three hundred twenty billion, one hundred two million, two hundred fifty-eight thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •