Base | Representation |
---|---|
bin | 11110010101101101010110… |
… | …100100100010010011110001 |
3 | 122111110002102020010222001211 |
4 | 132111231112210202103301 |
5 | 114442132144024344441 |
6 | 1151442211055000121 |
7 | 40051142056141324 |
oct | 3625552644422361 |
9 | 574402366128054 |
10 | 133433201403121 |
11 | 39574780660934 |
12 | 12b702b9209041 |
13 | 595b90a128889 |
14 | 24d42b69347bb |
15 | 1065d853d8a81 |
hex | 795b569224f1 |
133433201403121 has 2 divisors, whose sum is σ = 133433201403122. Its totient is φ = 133433201403120.
The previous prime is 133433201403119. The next prime is 133433201403137. The reversal of 133433201403121 is 121304102334331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70034804942400 + 63398396460721 = 8368680^2 + 7962311^2 .
It is a cyclic number.
It is not a de Polignac number, because 133433201403121 - 21 = 133433201403119 is a prime.
Together with 133433201403119, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (133433201403221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66716600701560 + 66716600701561.
It is an arithmetic number, because the mean of its divisors is an integer number (66716600701561).
Almost surely, 2133433201403121 is an apocalyptic number.
It is an amenable number.
133433201403121 is a deficient number, since it is larger than the sum of its proper divisors (1).
133433201403121 is an equidigital number, since it uses as much as digits as its factorization.
133433201403121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15552, while the sum is 31.
Adding to 133433201403121 its reverse (121304102334331), we get a palindrome (254737303737452).
The spelling of 133433201403121 in words is "one hundred thirty-three trillion, four hundred thirty-three billion, two hundred one million, four hundred three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •