Base | Representation |
---|---|
bin | 11100111011101100… |
… | …100010011010011001 |
3 | 2222012001201122212200 |
4 | 130323230202122121 |
5 | 1002110433131410 |
6 | 22134402400413 |
7 | 2146565132226 |
oct | 347354423231 |
9 | 88161648780 |
10 | 31066302105 |
11 | 121a2132643 |
12 | 6030060109 |
13 | 2c112778a7 |
14 | 1709cd494d |
15 | c1c5553c0 |
hex | 73bb22699 |
31066302105 has 24 divisors (see below), whose sum is σ = 54121613832. Its totient is φ = 16484584704.
The previous prime is 31066302083. The next prime is 31066302109. The reversal of 31066302105 is 50120366013.
31066302105 is a `hidden beast` number, since 3 + 1 + 0 + 6 + 630 + 21 + 0 + 5 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 10354487049 + 20711815056 = 101757^2 + 143916^2 .
It is not a de Polignac number, because 31066302105 - 227 = 30932084377 is a prime.
It is not an unprimeable number, because it can be changed into a prime (31066302109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1743324 + ... + 1761053.
It is an arithmetic number, because the mean of its divisors is an integer number (2255067243).
Almost surely, 231066302105 is an apocalyptic number.
It is an amenable number.
31066302105 is a deficient number, since it is larger than the sum of its proper divisors (23055311727).
31066302105 is a wasteful number, since it uses less digits than its factorization.
31066302105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3504585 (or 3504582 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
Adding to 31066302105 its reverse (50120366013), we get a palindrome (81186668118).
The spelling of 31066302105 in words is "thirty-one billion, sixty-six million, three hundred two thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •