Base | Representation |
---|---|
bin | 11100111110010011… |
… | …101001110000000001 |
3 | 2222022010011100022001 |
4 | 130332103221300001 |
5 | 1002203142011314 |
6 | 22143005344001 |
7 | 2150636400523 |
oct | 347623516001 |
9 | 88263140261 |
10 | 31110110209 |
11 | 12214934292 |
12 | 6042868001 |
13 | 2c1a375849 |
14 | 1711a59a13 |
15 | c2130a674 |
hex | 73e4e9c01 |
31110110209 has 4 divisors (see below), whose sum is σ = 32182872660. Its totient is φ = 30037347760.
The previous prime is 31110110191. The next prime is 31110110219. The reversal of 31110110209 is 90201101113.
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 17601859584 + 13508250625 = 132672^2 + 116225^2 .
It is a cyclic number.
It is not a de Polignac number, because 31110110209 - 215 = 31110077441 is a prime.
It is a super-2 number, since 2×311101102092 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31110110219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 536381182 + ... + 536381239.
It is an arithmetic number, because the mean of its divisors is an integer number (8045718165).
Almost surely, 231110110209 is an apocalyptic number.
It is an amenable number.
31110110209 is a deficient number, since it is larger than the sum of its proper divisors (1072762451).
31110110209 is a wasteful number, since it uses less digits than its factorization.
31110110209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1072762450.
The product of its (nonzero) digits is 54, while the sum is 19.
The spelling of 31110110209 in words is "thirty-one billion, one hundred ten million, one hundred ten thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •