Base | Representation |
---|---|
bin | 1110001001001000100000… |
… | …01101010011011001101101 |
3 | 11002010010212112120221212210 |
4 | 13010210100031103121231 |
5 | 13034021031302110013 |
6 | 150051111425321033 |
7 | 6356624134145304 |
oct | 704442015233155 |
9 | 132103775527783 |
10 | 31100130113133 |
11 | 9a00544740a64 |
12 | 35a34b6796179 |
13 | 1447964172633 |
14 | 79737bc4343b |
15 | 38debbdcbcc3 |
hex | 1c491035366d |
31100130113133 has 4 divisors (see below), whose sum is σ = 41466840150848. Its totient is φ = 20733420075420.
The previous prime is 31100130113131. The next prime is 31100130113153. The reversal of 31100130113133 is 33131103100113.
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 not a de Polignac number, because 31100130113133 - 21 = 31100130113131 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 (31100130113131) 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, 5183355018853 + ... + 5183355018858.
It is an arithmetic number, because the mean of its divisors is an integer number (10366710037712).
Almost surely, 231100130113133 is an apocalyptic number.
It is an amenable number.
31100130113133 is a deficient number, since it is larger than the sum of its proper divisors (10366710037715).
31100130113133 is a wasteful number, since it uses less digits than its factorization.
31100130113133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10366710037714.
The product of its (nonzero) digits is 243, while the sum is 21.
Adding to 31100130113133 its reverse (33131103100113), we get a palindrome (64231233213246).
The spelling of 31100130113133 in words is "thirty-one trillion, one hundred billion, one hundred thirty million, one hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •