Base | Representation |
---|---|
bin | 10110110010010100… |
… | …00100011100011111 |
3 | 1011120112222110220201 |
4 | 23121022010130133 |
5 | 200023201330421 |
6 | 5341520324331 |
7 | 612102511624 |
oct | 133112043437 |
9 | 34515873821 |
10 | 12233230111 |
11 | 5208380933 |
12 | 2454a736a7 |
13 | 11cc5850cb |
14 | 8409b034b |
15 | 4b8e90b91 |
hex | 2d928471f |
12233230111 has 4 divisors (see below), whose sum is σ = 12257551152. Its totient is φ = 12208909072.
The previous prime is 12233230099. The next prime is 12233230127. The reversal of 12233230111 is 11103233221.
12233230111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 12233230111 - 215 = 12233197343 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12233230511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12159766 + ... + 12160771.
It is an arithmetic number, because the mean of its divisors is an integer number (3064387788).
Almost surely, 212233230111 is an apocalyptic number.
12233230111 is a deficient number, since it is larger than the sum of its proper divisors (24321041).
12233230111 is an equidigital number, since it uses as much as digits as its factorization.
12233230111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24321040.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 12233230111 its reverse (11103233221), we get a palindrome (23336463332).
The spelling of 12233230111 in words is "twelve billion, two hundred thirty-three million, two hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •