Base | Representation |
---|---|
bin | 100011011110110101011111… |
… | …1101110010010001001000011 |
3 | 1111221001121000220212122010220 |
4 | 1012331222333232102021003 |
5 | 311401431440342043243 |
6 | 3023441210145354123 |
7 | 122511401261316414 |
oct | 10675527756221103 |
9 | 1457047026778126 |
10 | 312101310112323 |
11 | 90499471104186 |
12 | 2b0073a9338943 |
13 | 1051c047b6cb14 |
14 | 570dad946980b |
15 | 2613710a05783 |
hex | 11bdabfb92243 |
312101310112323 has 8 divisors (see below), whose sum is σ = 416137290473808. Its totient is φ = 208066434912864.
The previous prime is 312101310112321. The next prime is 312101310112367. The reversal of 312101310112323 is 323211013101213.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 312101310112323 - 21 = 312101310112321 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 312101310112293 and 312101310112302.
It is not an unprimeable number, because it can be changed into a prime (312101310112321) 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, 275631340 + ... + 276761337.
It is an arithmetic number, because the mean of its divisors is an integer number (52017161309226).
Almost surely, 2312101310112323 is an apocalyptic number.
312101310112323 is a deficient number, since it is larger than the sum of its proper divisors (104035980361485).
312101310112323 is a wasteful number, since it uses less digits than its factorization.
312101310112323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 552581013.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 312101310112323 its reverse (323211013101213), we get a palindrome (635312323213536).
The spelling of 312101310112323 in words is "three hundred twelve trillion, one hundred one billion, three hundred ten million, one hundred twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •