Base | Representation |
---|---|
bin | 11100111101111100… |
… | …110000111101000101 |
3 | 2222021200212112010002 |
4 | 130331330300331011 |
5 | 1002200123013110 |
6 | 22142233011045 |
7 | 2150534401424 |
oct | 347574607505 |
9 | 88250775102 |
10 | 31104110405 |
11 | 12211506575 |
12 | 6040853a85 |
13 | 2c19054974 |
14 | 1710d372bb |
15 | c20a22aa5 |
hex | 73df30f45 |
31104110405 has 4 divisors (see below), whose sum is σ = 37324932492. Its totient is φ = 24883288320.
The previous prime is 31104110393. The next prime is 31104110407. The reversal of 31104110405 is 50401140113.
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: 50401140113 = 122021 ⋅413053.
It can be written as a sum of positive squares in 2 ways, for example, as 14617293604 + 16486816801 = 120902^2 + 128401^2 .
It is not a de Polignac number, because 31104110405 - 228 = 30835674949 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 (31104110407) 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, 3110411036 + ... + 3110411045.
It is an arithmetic number, because the mean of its divisors is an integer number (9331233123).
Almost surely, 231104110405 is an apocalyptic number.
It is an amenable number.
31104110405 is a deficient number, since it is larger than the sum of its proper divisors (6220822087).
31104110405 is an equidigital number, since it uses as much as digits as its factorization.
31104110405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6220822086.
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 31104110405 its reverse (50401140113), we get a palindrome (81505250518).
The spelling of 31104110405 in words is "thirty-one billion, one hundred four million, one hundred ten thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •