Base | Representation |
---|---|
bin | 1011000111010011000011… |
… | …0100110110111100010111 |
3 | 1121021012221212222221220221 |
4 | 2301310300310312330113 |
5 | 3100203030241320043 |
6 | 41553442505335211 |
7 | 2400603006456544 |
oct | 261646064667427 |
9 | 47235855887827 |
10 | 12220001120023 |
11 | 399152306a564 |
12 | 1454399797507 |
13 | 6a84586b9408 |
14 | 303646197bcb |
15 | 162d0c2828ed |
hex | b1d30d36f17 |
12220001120023 has 4 divisors (see below), whose sum is σ = 12222128933728. Its totient is φ = 12217873306320.
The previous prime is 12220001119969. The next prime is 12220001120039. The reversal of 12220001120023 is 32002110002221.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12220001120023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12220001119979 and 12220001120006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12220001126023) 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, 1063898238 + ... + 1063909723.
It is an arithmetic number, because the mean of its divisors is an integer number (3055532233432).
Almost surely, 212220001120023 is an apocalyptic number.
12220001120023 is a deficient number, since it is larger than the sum of its proper divisors (2127813705).
12220001120023 is an equidigital number, since it uses as much as digits as its factorization.
12220001120023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2127813704.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 12220001120023 its reverse (32002110002221), we get a palindrome (44222111122244).
The spelling of 12220001120023 in words is "twelve trillion, two hundred twenty billion, one million, one hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •