Base | Representation |
---|---|
bin | 1001000101010111111… |
… | …11001110000101100111 |
3 | 1002211122101201102202111 |
4 | 10202223333032011213 |
5 | 20103212004401043 |
6 | 355215401421451 |
7 | 31356462522406 |
oct | 4425377160547 |
9 | 1084571642674 |
10 | 312123122023 |
11 | 110409402309 |
12 | 505a949a887 |
13 | 235826413ab |
14 | 1116d24d63d |
15 | 81bbb5009d |
hex | 48abfce167 |
312123122023 has 4 divisors (see below), whose sum is σ = 312210286488. Its totient is φ = 312035957560.
The previous prime is 312123121987. The next prime is 312123122053. The reversal of 312123122023 is 320221321213.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 312123122023 - 233 = 303533187431 is a prime.
It is a super-2 number, since 2×3121231220232 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 312123121985 and 312123122003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312123122053) 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, 43576861 + ... + 43584022.
It is an arithmetic number, because the mean of its divisors is an integer number (78052571622).
Almost surely, 2312123122023 is an apocalyptic number.
312123122023 is a deficient number, since it is larger than the sum of its proper divisors (87164465).
312123122023 is an equidigital number, since it uses as much as digits as its factorization.
312123122023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87164464.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 312123122023 its reverse (320221321213), we get a palindrome (632344443236).
The spelling of 312123122023 in words is "three hundred twelve billion, one hundred twenty-three million, one hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •