Base | Representation |
---|---|
bin | 1110001001110010000001… |
… | …11011101101101001111110 |
3 | 11002012021102010111120221012 |
4 | 13010321000323231221332 |
5 | 13034402210120002032 |
6 | 150105235443035222 |
7 | 6361343432511662 |
oct | 704710073555176 |
9 | 132167363446835 |
10 | 31122422422142 |
11 | 9a09a44108737 |
12 | 35a789836bb12 |
13 | 1449aa772b81c |
14 | 7984947548a2 |
15 | 38e873eea6b2 |
hex | 1c4e40eeda7e |
31122422422142 has 8 divisors (see below), whose sum is σ = 46684179138600. Its totient is φ = 15561029375944.
The previous prime is 31122422422141. The next prime is 31122422422177. The reversal of 31122422422142 is 24122422422113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×311224224221422 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31122422422099 and 31122422422108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31122422422141) 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, 90703517 + ... + 91045992.
It is an arithmetic number, because the mean of its divisors is an integer number (5835522392325).
Almost surely, 231122422422142 is an apocalyptic number.
31122422422142 is a deficient number, since it is larger than the sum of its proper divisors (15561756716458).
31122422422142 is a wasteful number, since it uses less digits than its factorization.
31122422422142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181835130.
The product of its digits is 24576, while the sum is 32.
Adding to 31122422422142 its reverse (24122422422113), we get a palindrome (55244844844255).
The spelling of 31122422422142 in words is "thirty-one trillion, one hundred twenty-two billion, four hundred twenty-two million, four hundred twenty-two thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •