Base | Representation |
---|---|
bin | 1001000011111101001… |
… | …01101101101100110111 |
3 | 1002202200022112001022201 |
4 | 10201332211231230313 |
5 | 20100132013223142 |
6 | 355012032405331 |
7 | 31331553515440 |
oct | 4417645555467 |
9 | 1082608461281 |
10 | 311361461047 |
11 | 11005847812a |
12 | 504163a6847 |
13 | 234908c3020 |
14 | 110da0242c7 |
15 | 8174d4cab7 |
hex | 487e96db37 |
311361461047 has 32 divisors (see below), whose sum is σ = 384564031488. Its totient is φ = 245485126656.
The previous prime is 311361461027. The next prime is 311361461053. The reversal of 311361461047 is 740164163113.
It is not a de Polignac number, because 311361461047 - 211 = 311361458999 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 311361460997 and 311361461015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (311361461017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 68837328 + ... + 68841850.
It is an arithmetic number, because the mean of its divisors is an integer number (12017625984).
Almost surely, 2311361461047 is an apocalyptic number.
311361461047 is a deficient number, since it is larger than the sum of its proper divisors (73202570441).
311361461047 is a wasteful number, since it uses less digits than its factorization.
311361461047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7039.
The product of its (nonzero) digits is 36288, while the sum is 37.
The spelling of 311361461047 in words is "three hundred eleven billion, three hundred sixty-one million, four hundred sixty-one thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.321 sec. • engine limits •