Base | Representation |
---|---|
bin | 1001000101110000110… |
… | …01000001000100001111 |
3 | 1002212011220021110012111 |
4 | 10202320121001010033 |
5 | 20104123242223043 |
6 | 355252153444451 |
7 | 31364600330026 |
oct | 4427031010417 |
9 | 1085156243174 |
10 | 312331211023 |
11 | 11050590a697 |
12 | 50647110727 |
13 | 235b679b490 |
14 | 1118cb398bd |
15 | 81d005609d |
hex | 48b864110f |
312331211023 has 4 divisors (see below), whose sum is σ = 336356688808. Its totient is φ = 288305733240.
The previous prime is 312331211021. The next prime is 312331211039. The reversal of 312331211023 is 320112133213.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320112133213 = 155627 ⋅2056919.
It is a cyclic number.
It is not a de Polignac number, because 312331211023 - 21 = 312331211021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 312331210985 and 312331211003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312331211021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12012738873 + ... + 12012738898.
It is an arithmetic number, because the mean of its divisors is an integer number (84089172202).
Almost surely, 2312331211023 is an apocalyptic number.
312331211023 is a deficient number, since it is larger than the sum of its proper divisors (24025477785).
312331211023 is a wasteful number, since it uses less digits than its factorization.
312331211023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24025477784.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 312331211023 its reverse (320112133213), we get a palindrome (632443344236).
The spelling of 312331211023 in words is "three hundred twelve billion, three hundred thirty-one million, two hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •