Base | Representation |
---|---|
bin | 1110001001011100110011… |
… | …11101010110100011001011 |
3 | 11002011012000020202120222111 |
4 | 13010232121331112203023 |
5 | 13034210342431401443 |
6 | 150100113240003151 |
7 | 6360461232200521 |
oct | 704563175264313 |
9 | 132135006676874 |
10 | 31111031122123 |
11 | 9a051290073a7 |
12 | 35a56394604b7 |
13 | 14489b071a804 |
14 | 797ad3906311 |
15 | 38e408e1569d |
hex | 1c4b99f568cb |
31111031122123 has 4 divisors (see below), whose sum is σ = 31119233348728. Its totient is φ = 31102828895520.
The previous prime is 31111031122117. The next prime is 31111031122133. The reversal of 31111031122123 is 32122113011113.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 31111031122123 - 213 = 31111031113931 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31111031122094 and 31111031122103.
It is not an unprimeable number, because it can be changed into a prime (31111031122133) 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, 4101107613 + ... + 4101115198.
It is an arithmetic number, because the mean of its divisors is an integer number (7779808337182).
Almost surely, 231111031122123 is an apocalyptic number.
31111031122123 is a deficient number, since it is larger than the sum of its proper divisors (8202226605).
31111031122123 is an equidigital number, since it uses as much as digits as its factorization.
31111031122123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8202226604.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 31111031122123 its reverse (32122113011113), we get a palindrome (63233144133236).
The spelling of 31111031122123 in words is "thirty-one trillion, one hundred eleven billion, thirty-one million, one hundred twenty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •