Base | Representation |
---|---|
bin | 11100111101101101… |
… | …100000010010111011 |
3 | 2222021102100021121100 |
4 | 130331231200102323 |
5 | 1002143112010021 |
6 | 22142011142443 |
7 | 2150455400445 |
oct | 347555402273 |
9 | 88242307540 |
10 | 31100110011 |
11 | 1220a223a63 |
12 | 603b444a23 |
13 | 2c18283b79 |
14 | 17105b5495 |
15 | c204d2626 |
hex | 73db604bb |
31100110011 has 12 divisors (see below), whose sum is σ = 45115184088. Its totient is φ = 20644420704.
The previous prime is 31100109973. The next prime is 31100110021. The reversal of 31100110011 is 11001100113.
It is not a de Polignac number, because 31100110011 - 29 = 31100109499 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
31100110011 is a modest number, since divided by 110011 gives 311 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 31100109975 and 31100110002.
It is not an unprimeable number, because it can be changed into a prime (31100110021) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7413285 + ... + 7417478.
It is an arithmetic number, because the mean of its divisors is an integer number (3759598674).
Almost surely, 231100110011 is an apocalyptic number.
31100110011 is a deficient number, since it is larger than the sum of its proper divisors (14015074077).
31100110011 is a wasteful number, since it uses less digits than its factorization.
31100110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14831002 (or 14830999 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 9.
Adding to 31100110011 its reverse (11001100113), we get a palindrome (42101210124).
It can be divided in two parts, 3 and 1100110011, that multiplied together give a palindrome (3300330033).
The spelling of 31100110011 in words is "thirty-one billion, one hundred million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •