Base | Representation |
---|---|
bin | 11101000100111110… |
… | …100110011100000101 |
3 | 2222120220202120022111 |
4 | 131010332212130011 |
5 | 1002420320012013 |
6 | 22202044301021 |
7 | 2153465615515 |
oct | 350476463405 |
9 | 88526676274 |
10 | 31222032133 |
11 | 12272028946 |
12 | 6074241771 |
13 | 2c37601936 |
14 | 1722871845 |
15 | c2b06773d |
hex | 744fa6705 |
31222032133 has 4 divisors (see below), whose sum is σ = 31222402048. Its totient is φ = 31221662220.
The previous prime is 31222032109. The next prime is 31222032197. The reversal of 31222032133 is 33123022213.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 33123022213 = 151 ⋅219357763.
It is a cyclic number.
It is not a de Polignac number, because 31222032133 - 213 = 31222023941 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31222032103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10498 + ... + 250108.
It is an arithmetic number, because the mean of its divisors is an integer number (7805600512).
Almost surely, 231222032133 is an apocalyptic number.
It is an amenable number.
31222032133 is a deficient number, since it is larger than the sum of its proper divisors (369915).
31222032133 is a wasteful number, since it uses less digits than its factorization.
31222032133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 369914.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 31222032133 its reverse (33123022213), we get a palindrome (64345054346).
The spelling of 31222032133 in words is "thirty-one billion, two hundred twenty-two million, thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •