Base | Representation |
---|---|
bin | 100011011111110010110111… |
… | …1000001010011011110100101 |
3 | 1111221112012012121001012200121 |
4 | 1012333211233001103132211 |
5 | 311411111342113131323 |
6 | 3024021523411041541 |
7 | 122524045202065003 |
oct | 10677455701233645 |
9 | 1457465177035617 |
10 | 312233100130213 |
11 | 9053a35013a239 |
12 | 2b028a495a02b1 |
13 | 1052b5bb84b022 |
14 | 571623c56da73 |
15 | 2616d75a9ea5d |
hex | 11bf96f0537a5 |
312233100130213 has 8 divisors (see below), whose sum is σ = 318883425944832. Its totient is φ = 305583068830896.
The previous prime is 312233100130153. The next prime is 312233100130219. The reversal of 312233100130213 is 312031001332213.
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 312233100130213 - 229 = 312232563259301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312233100130219) 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, 71485270 + ... + 75727207.
It is an arithmetic number, because the mean of its divisors is an integer number (39860428243104).
Almost surely, 2312233100130213 is an apocalyptic number.
It is an amenable number.
312233100130213 is a deficient number, since it is larger than the sum of its proper divisors (6650325814619).
312233100130213 is a wasteful number, since it uses less digits than its factorization.
312233100130213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147257651.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 312233100130213 its reverse (312031001332213), we get a palindrome (624264101462426).
The spelling of 312233100130213 in words is "three hundred twelve trillion, two hundred thirty-three billion, one hundred million, one hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •