Base | Representation |
---|---|
bin | 11101010100110010… |
… | …100010000101110011 |
3 | 10000021101220202222100 |
4 | 131110302202011303 |
5 | 1003441222212201 |
6 | 22244242111443 |
7 | 2163166445160 |
oct | 352462420563 |
9 | 100241822870 |
10 | 31487304051 |
11 | 12398842635 |
12 | 612904b583 |
13 | 2c7a560678 |
14 | 1749ba5067 |
15 | c444b6886 |
hex | 754ca2173 |
31487304051 has 96 divisors (see below), whose sum is σ = 55607552000. Its totient is φ = 16769286144.
The previous prime is 31487304031. The next prime is 31487304053. The reversal of 31487304051 is 15040378413.
It is a happy number.
It is not a de Polignac number, because 31487304051 - 27 = 31487303923 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31487303997 and 31487304015.
It is not an unprimeable number, because it can be changed into a prime (31487304053) 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 95 ways as a sum of consecutive naturals, for example, 40945395 + ... + 40946163.
Almost surely, 231487304051 is an apocalyptic number.
31487304051 is a deficient number, since it is larger than the sum of its proper divisors (24120247949).
31487304051 is a wasteful number, since it uses less digits than its factorization.
31487304051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1313 (or 1310 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 36.
The spelling of 31487304051 in words is "thirty-one billion, four hundred eighty-seven million, three hundred four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •