Base | Representation |
---|---|
bin | 1110001001101111111100… |
… | …01101111010110011010111 |
3 | 11002012011112010100012120110 |
4 | 13010313332031322303113 |
5 | 13034342412044333421 |
6 | 150104532420334103 |
7 | 6361303621560450 |
oct | 704677615726327 |
9 | 132164463305513 |
10 | 31121303121111 |
11 | 9a0951a310265 |
12 | 35a7625544333 |
13 | 1449959880918 |
14 | 7983c9c30127 |
15 | 38e80ab00a76 |
hex | 1c4dfe37acd7 |
31121303121111 has 16 divisors (see below), whose sum is σ = 47423779582464. Its totient is φ = 17783286223584.
The previous prime is 31121303121089. The next prime is 31121303121121. The reversal of 31121303121111 is 11112130312113.
It is not a de Polignac number, because 31121303121111 - 219 = 31121302596823 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31121303121121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11934075 + ... + 14306108.
It is an arithmetic number, because the mean of its divisors is an integer number (2963986223904).
Almost surely, 231121303121111 is an apocalyptic number.
31121303121111 is a deficient number, since it is larger than the sum of its proper divisors (16302476461353).
31121303121111 is a wasteful number, since it uses less digits than its factorization.
31121303121111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26296670.
The product of its (nonzero) digits is 108, while the sum is 21.
Adding to 31121303121111 its reverse (11112130312113), we get a palindrome (42233433433224).
The spelling of 31121303121111 in words is "thirty-one trillion, one hundred twenty-one billion, three hundred three million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •