Base | Representation |
---|---|
bin | 1110001001100000101110… |
… | …01000001101100111001101 |
3 | 11002011101102121021121000102 |
4 | 13010300113020031213031 |
5 | 13034224143031333401 |
6 | 150101101454140445 |
7 | 6360564251661521 |
oct | 704602710154715 |
9 | 132141377247012 |
10 | 31113131121101 |
11 | 9a06006444747 |
12 | 35a5b247b1725 |
13 | 1448c56808063 |
14 | 797c52791d81 |
15 | 38e4cd47c56b |
hex | 1c4c1720d9cd |
31113131121101 has 4 divisors (see below), whose sum is σ = 31113146820192. Its totient is φ = 31113115422012.
The previous prime is 31113131121089. The next prime is 31113131121161. The reversal of 31113131121101 is 10112113131113.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31113131121101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31113131121161) 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, 4359551 + ... + 9012876.
It is an arithmetic number, because the mean of its divisors is an integer number (7778286705048).
Almost surely, 231113131121101 is an apocalyptic number.
It is an amenable number.
31113131121101 is a deficient number, since it is larger than the sum of its proper divisors (15699091).
31113131121101 is a wasteful number, since it uses less digits than its factorization.
31113131121101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15699090.
The product of its (nonzero) digits is 54, while the sum is 20.
Adding to 31113131121101 its reverse (10112113131113), we get a palindrome (41225244252214).
The spelling of 31113131121101 in words is "thirty-one trillion, one hundred thirteen billion, one hundred thirty-one million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •