Base | Representation |
---|---|
bin | 10010101010110… |
… | …000110110001100 |
3 | 210211100012122110 |
4 | 102222300312030 |
5 | 1120134400022 |
6 | 51024544020 |
7 | 10522104366 |
oct | 2252606614 |
9 | 724305573 |
10 | 313200012 |
11 | 15087a894 |
12 | 88a82010 |
13 | 4cb70068 |
14 | 2d84bd36 |
15 | 1c76a00c |
hex | 12ab0d8c |
313200012 has 12 divisors (see below), whose sum is σ = 730800056. Its totient is φ = 104400000.
The previous prime is 313200011. The next prime is 313200023. The reversal of 313200012 is 210002313.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 26100001 = 313200012 / (3 + 1 + 3 + 2 + 0 + 0 + 0 + 1 + 2).
It is not an unprimeable number, because it can be changed into a prime (313200011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13049989 + ... + 13050012.
Almost surely, 2313200012 is an apocalyptic number.
It is an amenable number.
313200012 is an abundant number, since it is smaller than the sum of its proper divisors (417600044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
313200012 is a wasteful number, since it uses less digits than its factorization.
313200012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26100008 (or 26100006 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
The square root of 313200012 is about 17697.4577835349. The cubic root of 313200012 is about 679.1107262510.
Adding to 313200012 its reverse (210002313), we get a palindrome (523202325).
The spelling of 313200012 in words is "three hundred thirteen million, two hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •