Base | Representation |
---|---|
bin | 1001000101001010101… |
… | …00101001110101101000 |
3 | 1002211100121022022001111 |
4 | 10202211110221311220 |
5 | 20102444343101300 |
6 | 355200325000104 |
7 | 31353634202305 |
oct | 4424524516550 |
9 | 1084317268044 |
10 | 312011300200 |
11 | 110361276986 |
12 | 50577b53034 |
13 | 2356541ba32 |
14 | 1115c4620ac |
15 | 81b1e129ba |
hex | 48a5529d68 |
312011300200 has 96 divisors (see below), whose sum is σ = 735875055000. Its totient is φ = 123009269760.
The previous prime is 312011300189. The next prime is 312011300267. The reversal of 312011300200 is 2003110213.
It can be written as a sum of positive squares in 12 ways, for example, as 15184647076 + 296826653124 = 123226^2 + 544818^2 .
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 23543176 + ... + 23556424.
Almost surely, 2312011300200 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 312011300200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (367937527500).
312011300200 is an abundant number, since it is smaller than the sum of its proper divisors (423863754800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
312011300200 is a wasteful number, since it uses less digits than its factorization.
312011300200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14951 (or 14942 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 312011300200 its reverse (2003110213), we get a palindrome (314014410413).
The spelling of 312011300200 in words is "three hundred twelve billion, eleven million, three hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •