Base | Representation |
---|---|
bin | 1001000101010110110… |
… | …00111111110100101011 |
3 | 1002211121200212101001002 |
4 | 10202223120333310223 |
5 | 20103201423231443 |
6 | 355214402545215 |
7 | 31356311411024 |
oct | 4425330776453 |
9 | 1084550771032 |
10 | 312113102123 |
11 | 1104037891a9 |
12 | 505a606820b |
13 | 23580543764 |
14 | 1116bba1c4b |
15 | 81bad212b8 |
hex | 48ab63fd2b |
312113102123 has 8 divisors (see below), whose sum is σ = 312337973376. Its totient is φ = 311888315200.
The previous prime is 312113102111. The next prime is 312113102153. The reversal of 312113102123 is 321201311213.
It is a happy number.
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 312113102123 - 212 = 312113098027 is a prime.
It is a super-4 number, since 4×3121131021234 (a number of 47 digits) contains 4444 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 312113102095 and 312113102104.
It is not an unprimeable number, because it can be changed into a prime (312113102153) 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, 8605958 + ... + 8642148.
It is an arithmetic number, because the mean of its divisors is an integer number (39042246672).
Almost surely, 2312113102123 is an apocalyptic number.
312113102123 is a deficient number, since it is larger than the sum of its proper divisors (224871253).
312113102123 is a wasteful number, since it uses less digits than its factorization.
312113102123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42165.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 312113102123 its reverse (321201311213), we get a palindrome (633314413336).
The spelling of 312113102123 in words is "three hundred twelve billion, one hundred thirteen million, one hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •