Base | Representation |
---|---|
bin | 11100111101111100… |
… | …101111010000001001 |
3 | 2222021200212011112212 |
4 | 130331330233100021 |
5 | 1002200122302213 |
6 | 22142232514505 |
7 | 2150534342204 |
oct | 347574572011 |
9 | 88250764485 |
10 | 31104103433 |
11 | 12211501307 |
12 | 604084ba35 |
13 | 2c19051740 |
14 | 1710d3493b |
15 | c20a209a8 |
hex | 73df2f409 |
31104103433 has 4 divisors (see below), whose sum is σ = 33496726788. Its totient is φ = 28711480080.
The previous prime is 31104103427. The next prime is 31104103441. The reversal of 31104103433 is 33430140113.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 19798459849 + 11305643584 = 140707^2 + 106328^2 .
It is a cyclic number.
It is not a de Polignac number, because 31104103433 - 24 = 31104103417 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 31104103399 and 31104103408.
It is not an unprimeable number, because it can be changed into a prime (31104103453) 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, 1196311658 + ... + 1196311683.
It is an arithmetic number, because the mean of its divisors is an integer number (8374181697).
Almost surely, 231104103433 is an apocalyptic number.
It is an amenable number.
31104103433 is a deficient number, since it is larger than the sum of its proper divisors (2392623355).
31104103433 is a wasteful number, since it uses less digits than its factorization.
31104103433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2392623354.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 31104103433 its reverse (33430140113), we get a palindrome (64534243546).
The spelling of 31104103433 in words is "thirty-one billion, one hundred four million, one hundred three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •