Base | Representation |
---|---|
bin | 10110010110110001… |
… | …10111111101011111 |
3 | 1010222110022110111011 |
4 | 23023120313331133 |
5 | 144040032330421 |
6 | 5302545240051 |
7 | 603266162344 |
oct | 131330677537 |
9 | 33873273434 |
10 | 12002230111 |
11 | 50a9a45143 |
12 | 23ab633027 |
13 | 1193765911 |
14 | 81c03c7cb |
15 | 4a3a614e1 |
hex | 2cb637f5f |
12002230111 has 4 divisors (see below), whose sum is σ = 12205657800. Its totient is φ = 11798802424.
The previous prime is 12002230069. The next prime is 12002230117. The reversal of 12002230111 is 11103220021.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11103220021 = 2647 ⋅4194643.
It is a cyclic number.
It is not a de Polignac number, because 12002230111 - 27 = 12002229983 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12002230091 and 12002230100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12002230117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 101713756 + ... + 101713873.
It is an arithmetic number, because the mean of its divisors is an integer number (3051414450).
Almost surely, 212002230111 is an apocalyptic number.
12002230111 is a deficient number, since it is larger than the sum of its proper divisors (203427689).
12002230111 is an equidigital number, since it uses as much as digits as its factorization.
12002230111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203427688.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 12002230111 its reverse (11103220021), we get a palindrome (23105450132).
The spelling of 12002230111 in words is "twelve billion, two million, two hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •