Base | Representation |
---|---|
bin | 11110010011111011100011… |
… | …100001010101100111111001 |
3 | 122111000102000122102021002212 |
4 | 132103323203201111213321 |
5 | 114433131423044204401 |
6 | 1151310122234104505 |
7 | 40036255104202616 |
oct | 3623734341254771 |
9 | 574012018367085 |
10 | 133311012100601 |
11 | 39527978a13395 |
12 | 12b5069827b135 |
13 | 59502364b703a |
14 | 24cc40493750d |
15 | 1062ad312adbb |
hex | 793ee38559f9 |
133311012100601 has 2 divisors, whose sum is σ = 133311012100602. Its totient is φ = 133311012100600.
The previous prime is 133311012100571. The next prime is 133311012100691. The reversal of 133311012100601 is 106001210113331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 124929263334976 + 8381748765625 = 11177176^2 + 2895125^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133311012100601 is a prime.
It is a super-2 number, since 2×1333110121006012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (133311012100691) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66655506050300 + 66655506050301.
It is an arithmetic number, because the mean of its divisors is an integer number (66655506050301).
Almost surely, 2133311012100601 is an apocalyptic number.
It is an amenable number.
133311012100601 is a deficient number, since it is larger than the sum of its proper divisors (1).
133311012100601 is an equidigital number, since it uses as much as digits as its factorization.
133311012100601 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 133311012100601 its reverse (106001210113331), we get a palindrome (239312222213932).
The spelling of 133311012100601 in words is "one hundred thirty-three trillion, three hundred eleven billion, twelve million, one hundred thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •