Base | Representation |
---|---|
bin | 1001000101011100100… |
… | …10001101110011110010 |
3 | 1002211202002020011111200 |
4 | 10202232102031303302 |
5 | 20103301340443200 |
6 | 355223255352030 |
7 | 31360441203456 |
oct | 4425622156362 |
9 | 1084662204450 |
10 | 312161656050 |
11 | 110429131512 |
12 | 505ba382616 |
13 | 2358a6138aa |
14 | 11174400666 |
15 | 81c0212800 |
hex | 48ae48dcf2 |
312161656050 has 36 divisors (see below), whose sum is σ = 838674317130. Its totient is φ = 83243108160.
The previous prime is 312161656049. The next prime is 312161656067. The reversal of 312161656050 is 50656161213.
312161656050 is a `hidden beast` number, since 31 + 2 + 1 + 6 + 16 + 5 + 605 + 0 = 666.
It can be written as a sum of positive squares in 3 ways, for example, as 244576735209 + 67584920841 = 494547^2 + 259971^2 .
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 312161655996 and 312161656014.
It is an unprimeable number.
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 17 ways as a sum of consecutive naturals, for example, 346845835 + ... + 346846734.
Almost surely, 2312161656050 is an apocalyptic number.
312161656050 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
312161656050 is an abundant number, since it is smaller than the sum of its proper divisors (526512661080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
312161656050 is a wasteful number, since it uses less digits than its factorization.
312161656050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 693692587 (or 693692579 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 36.
The spelling of 312161656050 in words is "three hundred twelve billion, one hundred sixty-one million, six hundred fifty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •