Base | Representation |
---|---|
bin | 1001000111001101101… |
… | …11101110001010100000 |
3 | 1002221012020121110001011 |
4 | 10203212313232022200 |
5 | 20112222404341000 |
6 | 355501411350304 |
7 | 31423116455203 |
oct | 4434667561240 |
9 | 1087166543034 |
10 | 313111012000 |
11 | 110876004706 |
12 | 508242b2394 |
13 | 236ac1cb487 |
14 | 1122452793a |
15 | 822873d2ba |
hex | 48e6dee2a0 |
313111012000 has 144 divisors (see below), whose sum is σ = 773622086328. Its totient is φ = 124546867200.
The previous prime is 313111011977. The next prime is 313111012013. The reversal of 313111012000 is 210111313.
It can be written as a sum of positive squares in 12 ways, for example, as 105965874576 + 207145137424 = 325524^2 + 455132^2 .
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 23 ways as a sum of consecutive naturals, for example, 155234992 + ... + 155237008.
Almost surely, 2313111012000 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 313111012000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (386811043164).
313111012000 is an abundant number, since it is smaller than the sum of its proper divisors (460511074328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
313111012000 is an equidigital number, since it uses as much as digits as its factorization.
313111012000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2436 (or 2221 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 313111012000 its reverse (210111313), we get a palindrome (313321123313).
The spelling of 313111012000 in words is "three hundred thirteen billion, one hundred eleven million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •