Base | Representation |
---|---|
bin | 1110001001011011001000… |
… | …11011101011001000111001 |
3 | 11002011002200122222101202002 |
4 | 13010231210123223020321 |
5 | 13034202023033213423 |
6 | 150055444200150345 |
7 | 6360430046143463 |
oct | 704554433531071 |
9 | 132132618871662 |
10 | 31110133101113 |
11 | 9a04808106980 |
12 | 35a54287683b5 |
13 | 1448899667b31 |
14 | 797a4a543133 |
15 | 38e3a517a228 |
hex | 1c4b646eb239 |
31110133101113 has 32 divisors (see below), whose sum is σ = 34357089973248. Its totient is φ = 27934364376000.
The previous prime is 31110133101079. The next prime is 31110133101121.
It is a happy number.
31110133101113 is nontrivially palindromic in base 10.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31110133101113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31110133101413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1789266806 + ... + 1789284192.
It is an arithmetic number, because the mean of its divisors is an integer number (1073659061664).
Almost surely, 231110133101113 is an apocalyptic number.
It is an amenable number.
31110133101113 is a deficient number, since it is larger than the sum of its proper divisors (3246956872135).
31110133101113 is a wasteful number, since it uses less digits than its factorization.
31110133101113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21293.
The product of its (nonzero) digits is 81, while the sum is 20.
It can be divided in two parts, 3111013 and 3101113, that added together give a palindrome (6212126).
The spelling of 31110133101113 in words is "thirty-one trillion, one hundred ten billion, one hundred thirty-three million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •