Base | Representation |
---|---|
bin | 1110001001110001110110… |
… | …11011111101001111100101 |
3 | 11002012021011200222210102212 |
4 | 13010320323123331033211 |
5 | 13034402013013230201 |
6 | 150105222350413205 |
7 | 6361341232650500 |
oct | 704707333751745 |
9 | 132167150883385 |
10 | 31122330211301 |
11 | 9a099a705732a |
12 | 35a7871501205 |
13 | 1449a915b44b4 |
14 | 7984863d0137 |
15 | 38e86ad83abb |
hex | 1c4e3b6fd3e5 |
31122330211301 has 12 divisors (see below), whose sum is σ = 36355006186560. Its totient is φ = 26564666781240.
The previous prime is 31122330211261. The next prime is 31122330211303. The reversal of 31122330211301 is 10311203322113.
It is not a de Polignac number, because 31122330211301 - 26 = 31122330211237 is a prime.
It is a super-2 number, since 2×311223302113012 (a number of 28 digits) contains 22 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 (31122330211303) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1328753135 + ... + 1328776556.
It is an arithmetic number, because the mean of its divisors is an integer number (3029583848880).
Almost surely, 231122330211301 is an apocalyptic number.
It is an amenable number.
31122330211301 is a deficient number, since it is larger than the sum of its proper divisors (5232675975259).
31122330211301 is a wasteful number, since it uses less digits than its factorization.
31122330211301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2657529944 (or 2657529937 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 31122330211301 its reverse (10311203322113), we get a palindrome (41433533533414).
The spelling of 31122330211301 in words is "thirty-one trillion, one hundred twenty-two billion, three hundred thirty million, two hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •