Base | Representation |
---|---|
bin | 1001000101001101000… |
… | …00100100111110001101 |
3 | 1002211101222202110212010 |
4 | 10202212200210332031 |
5 | 20103014442000323 |
6 | 355202315331433 |
7 | 31354265315502 |
oct | 4424640447615 |
9 | 1084358673763 |
10 | 312031203213 |
11 | 110371530354 |
12 | 50582750b79 |
13 | 23569599c72 |
14 | 11160d634a9 |
15 | 81b3a44c93 |
hex | 48a6824f8d |
312031203213 has 8 divisors (see below), whose sum is σ = 416050733088. Its totient is φ = 208016237744.
The previous prime is 312031203137. The next prime is 312031203241. The reversal of 312031203213 is 312302130213.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 312031203213 - 28 = 312031202957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 312031203213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312031203283) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 978270 + ... + 1257407.
It is an arithmetic number, because the mean of its divisors is an integer number (52006341636).
Almost surely, 2312031203213 is an apocalyptic number.
It is an amenable number.
312031203213 is a deficient number, since it is larger than the sum of its proper divisors (104019529875).
312031203213 is a wasteful number, since it uses less digits than its factorization.
312031203213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2282203.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 312031203213 its reverse (312302130213), we get a palindrome (624333333426).
The spelling of 312031203213 in words is "three hundred twelve billion, thirty-one million, two hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •