Base | Representation |
---|---|
bin | 1110001001110001011100… |
… | …11111110010010001000111 |
3 | 11002012020121120110221222002 |
4 | 13010320232133302101013 |
5 | 13034401041424023421 |
6 | 150105145033255515 |
7 | 6361332655432361 |
oct | 704705637622107 |
9 | 132166546427862 |
10 | 31122113111111 |
11 | 9a098a5554790 |
12 | 35a781086459b |
13 | 1449a58620949 |
14 | 798465639d31 |
15 | 38e856c9cb0b |
hex | 1c4e2e7f2447 |
31122113111111 has 8 divisors (see below), whose sum is σ = 35427543778944. Its totient is φ = 27062707052920.
The previous prime is 31122113111101. The next prime is 31122113111119. The reversal of 31122113111111 is 11111131122113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31122113111111 - 210 = 31122113110087 is a prime.
It is a super-3 number, since 3×311221131111113 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31122113111119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61506152141 + ... + 61506152646.
It is an arithmetic number, because the mean of its divisors is an integer number (4428442972368).
Almost surely, 231122113111111 is an apocalyptic number.
31122113111111 is a deficient number, since it is larger than the sum of its proper divisors (4305430667833).
31122113111111 is a wasteful number, since it uses less digits than its factorization.
31122113111111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 123012304821.
The product of its digits is 36, while the sum is 20.
Adding to 31122113111111 its reverse (11111131122113), we get a palindrome (42233244233224).
The spelling of 31122113111111 in words is "thirty-one trillion, one hundred twenty-two billion, one hundred thirteen million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •