Base | Representation |
---|---|
bin | 1011000001101010000110… |
… | …1111100010100010011011 |
3 | 1120220221212110201022002022 |
4 | 2300122201233202202123 |
5 | 3042111112443201243 |
6 | 41441140324325055 |
7 | 2360602666561046 |
oct | 260324157424233 |
9 | 46827773638068 |
10 | 12123111303323 |
11 | 3954423311189 |
12 | 143965954378b |
13 | 69c28735bb27 |
14 | 2dca94221c5d |
15 | 16053b103b68 |
hex | b06a1be289b |
12123111303323 has 4 divisors (see below), whose sum is σ = 12240811413168. Its totient is φ = 12005411193480.
The previous prime is 12123111303311. The next prime is 12123111303349. The reversal of 12123111303323 is 32330311132121.
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 12123111303323 - 218 = 12123111041179 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12123111303292 and 12123111303301.
It is not an unprimeable number, because it can be changed into a prime (12123111303923) 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, 58850054768 + ... + 58850054973.
It is an arithmetic number, because the mean of its divisors is an integer number (3060202853292).
Almost surely, 212123111303323 is an apocalyptic number.
12123111303323 is a deficient number, since it is larger than the sum of its proper divisors (117700109845).
12123111303323 is a wasteful number, since it uses less digits than its factorization.
12123111303323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117700109844.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 12123111303323 its reverse (32330311132121), we get a palindrome (44453422435444).
The spelling of 12123111303323 in words is "twelve trillion, one hundred twenty-three billion, one hundred eleven million, three hundred three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •