Base | Representation |
---|---|
bin | 100011100000010011100001… |
… | …1110100011101011011101101 |
3 | 1111221202220020220220210020212 |
4 | 1013000213003310131123231 |
5 | 311413234020012200323 |
6 | 3024114043501152205 |
7 | 122532110323525130 |
oct | 10700470364353355 |
9 | 1457686226823225 |
10 | 312303242303213 |
11 | 90567074607a57 |
12 | 2b03a563b5b665 |
13 | 105350b9583ac5 |
14 | 57197b3dd4217 |
15 | 2618acd8e5b78 |
hex | 11c09c3d1d6ed |
312303242303213 has 8 divisors (see below), whose sum is σ = 363652292924928. Its totient is φ = 262637767111824.
The previous prime is 312303242303191. The next prime is 312303242303237.
312303242303213 is nontrivially palindromic in base 10.
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 312303242303213 - 214 = 312303242286829 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 312303242303213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312303242303293) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 420893857181 + ... + 420893857922.
It is an arithmetic number, because the mean of its divisors is an integer number (45456536615616).
Almost surely, 2312303242303213 is an apocalyptic number.
It is an amenable number.
312303242303213 is a deficient number, since it is larger than the sum of its proper divisors (51349050621715).
312303242303213 is an equidigital number, since it uses as much as digits as its factorization.
312303242303213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 841787715163.
The product of its (nonzero) digits is 46656, while the sum is 32.
The spelling of 312303242303213 in words is "three hundred twelve trillion, three hundred three billion, two hundred forty-two million, three hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •