Base | Representation |
---|---|
bin | 1001000101101111101… |
… | …11000010000010101011 |
3 | 1002212011021111211111020 |
4 | 10202313313002002223 |
5 | 20104114002131443 |
6 | 355251234503523 |
7 | 31364431523406 |
oct | 4426767020253 |
9 | 1085137454436 |
10 | 312322302123 |
11 | 110500885267 |
12 | 50644134ba3 |
13 | 235b499c440 |
14 | 1118b89ad3d |
15 | 81ce396583 |
hex | 48b7dc20ab |
312322302123 has 16 divisors (see below), whose sum is σ = 449923600896. Its totient is φ = 191572279200.
The previous prime is 312322302113. The next prime is 312322302133. The reversal of 312322302123 is 321203223213.
It is an interprime number because it is at equal distance from previous prime (312322302113) and next prime (312322302133).
It is not a de Polignac number, because 312322302123 - 24 = 312322302107 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 312322302093 and 312322302102.
It is not an unprimeable number, because it can be changed into a prime (312322302113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13030803 + ... + 13054748.
It is an arithmetic number, because the mean of its divisors is an integer number (28120225056).
Almost surely, 2312322302123 is an apocalyptic number.
312322302123 is a deficient number, since it is larger than the sum of its proper divisors (137601298773).
312322302123 is a wasteful number, since it uses less digits than its factorization.
312322302123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26085874.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 312322302123 its reverse (321203223213), we get a palindrome (633525525336).
The spelling of 312322302123 in words is "three hundred twelve billion, three hundred twenty-two million, three hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •