Base | Representation |
---|---|
bin | 11100111101111000… |
… | …100101000011101101 |
3 | 2222021121210202220012 |
4 | 130331320211003231 |
5 | 1002144332404401 |
6 | 22142153303005 |
7 | 2150522151326 |
oct | 347570450355 |
9 | 88247722805 |
10 | 31103013101 |
11 | 12210927106 |
12 | 6040404a65 |
13 | 2c18a5c384 |
14 | 1710b2d44d |
15 | c208a78bb |
hex | 73de250ed |
31103013101 has 4 divisors (see below), whose sum is σ = 31106151804. Its totient is φ = 31099874400.
The previous prime is 31103013013. The next prime is 31103013107. The reversal of 31103013101 is 10131030113.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10131030113 = 31 ⋅326807423.
It can be written as a sum of positive squares in 2 ways, for example, as 302412100 + 30800601001 = 17390^2 + 175501^2 .
It is a cyclic number.
It is not a de Polignac number, because 31103013101 - 210 = 31103012077 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 (31103013107) 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, 1554440 + ... + 1574321.
It is an arithmetic number, because the mean of its divisors is an integer number (7776537951).
Almost surely, 231103013101 is an apocalyptic number.
It is an amenable number.
31103013101 is a deficient number, since it is larger than the sum of its proper divisors (3138703).
31103013101 is an equidigital number, since it uses as much as digits as its factorization.
31103013101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3138702.
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 31103013101 its reverse (10131030113), we get a palindrome (41234043214).
The spelling of 31103013101 in words is "thirty-one billion, one hundred three million, thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •