Base | Representation |
---|---|
bin | 1001000101100011101… |
… | …01000011011100111001 |
3 | 1002211220020010021010210 |
4 | 10202301311003130321 |
5 | 20103412101322223 |
6 | 355233222101333 |
7 | 31362062506614 |
oct | 4426165033471 |
9 | 1084806107123 |
10 | 312221120313 |
11 | 110459756933 |
12 | 5061627a849 |
13 | 23599a33a4b |
14 | 1117c27d17b |
15 | 81c555b893 |
hex | 48b1d43739 |
312221120313 has 8 divisors (see below), whose sum is σ = 416356978176. Its totient is φ = 208116338000.
The previous prime is 312221120303. The next prime is 312221120347. The reversal of 312221120313 is 313021122213.
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 312221120313 - 210 = 312221119289 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 312221120313.
It is not an unprimeable number, because it can be changed into a prime (312221120303) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 7745433 + ... + 7785638.
It is an arithmetic number, because the mean of its divisors is an integer number (52044622272).
Almost surely, 2312221120313 is an apocalyptic number.
It is an amenable number.
312221120313 is a deficient number, since it is larger than the sum of its proper divisors (104135857863).
312221120313 is a wasteful number, since it uses less digits than its factorization.
312221120313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15537775.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 312221120313 its reverse (313021122213), we get a palindrome (625242242526).
The spelling of 312221120313 in words is "three hundred twelve billion, two hundred twenty-one million, one hundred twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •