Base | Representation |
---|---|
bin | 1001000101100010100… |
… | …10010011010101000111 |
3 | 1002211212120222102120022 |
4 | 10202301102103111013 |
5 | 20103402233312221 |
6 | 355232254525355 |
7 | 31361622205055 |
oct | 4426122232507 |
9 | 1084776872508 |
10 | 312212010311 |
11 | 1104545a4403 |
12 | 5061320685b |
13 | 23597b94306 |
14 | 1117ad8b1d5 |
15 | 81c485c4ab |
hex | 48b1493547 |
312212010311 has 8 divisors (see below), whose sum is σ = 329575231920. Its totient is φ = 294941889792.
The previous prime is 312212010287. The next prime is 312212010337. The reversal of 312212010311 is 113010212213.
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 312212010311 - 222 = 312207816007 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 312212010311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312212019311) 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, 23268380 + ... + 23281793.
It is an arithmetic number, because the mean of its divisors is an integer number (41196903990).
Almost surely, 2312212010311 is an apocalyptic number.
312212010311 is a deficient number, since it is larger than the sum of its proper divisors (17363221609).
312212010311 is a wasteful number, since it uses less digits than its factorization.
312212010311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46550545.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 312212010311 its reverse (113010212213), we get a palindrome (425222222524).
The spelling of 312212010311 in words is "three hundred twelve billion, two hundred twelve million, ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •