Base | Representation |
---|---|
bin | 11110010010110010000100… |
… | …000000011100011101110111 |
3 | 122110201212100010210221102221 |
4 | 132102302010000130131313 |
5 | 114430333320124343111 |
6 | 1151205552030543211 |
7 | 40030462434320134 |
oct | 3622620400343567 |
9 | 573655303727387 |
10 | 133232100231031 |
11 | 394a746425485a |
12 | 12b39334967b07 |
13 | 594596b9383a9 |
14 | 24c867a4cb58b |
15 | 1060a1544b371 |
hex | 792c8401c777 |
133232100231031 has 2 divisors, whose sum is σ = 133232100231032. Its totient is φ = 133232100231030.
The previous prime is 133232100231011. The next prime is 133232100231077. The reversal of 133232100231031 is 130132001232331.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 133232100231031 - 213 = 133232100222839 is a prime.
It is a super-2 number, since 2×1332321002310312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133232100230987 and 133232100231005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133232100231011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66616050115515 + 66616050115516.
It is an arithmetic number, because the mean of its divisors is an integer number (66616050115516).
Almost surely, 2133232100231031 is an apocalyptic number.
133232100231031 is a deficient number, since it is larger than the sum of its proper divisors (1).
133232100231031 is an equidigital number, since it uses as much as digits as its factorization.
133232100231031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 133232100231031 its reverse (130132001232331), we get a palindrome (263364101463362).
The spelling of 133232100231031 in words is "one hundred thirty-three trillion, two hundred thirty-two billion, one hundred million, two hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •