Base | Representation |
---|---|
bin | 1101100100000100110… |
… | …1001110111110000011 |
3 | 211021110201102101100111 |
4 | 3121001031032332003 |
5 | 12304212142102321 |
6 | 255014322532151 |
7 | 22556336131222 |
oct | 3310115167603 |
9 | 737421371314 |
10 | 233022222211 |
11 | 8a907a73539 |
12 | 391b2807057 |
13 | 18c8787952c |
14 | b3c7a78cb9 |
15 | 60dc5815e1 |
hex | 364134ef83 |
233022222211 has 4 divisors (see below), whose sum is σ = 234229591432. Its totient is φ = 231814852992.
The previous prime is 233022222193. The next prime is 233022222217. The reversal of 233022222211 is 112222220332.
233022222211 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 233022222211 - 25 = 233022222179 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (233022222217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 603684321 + ... + 603684706.
It is an arithmetic number, because the mean of its divisors is an integer number (58557397858).
Almost surely, 2233022222211 is an apocalyptic number.
233022222211 is a deficient number, since it is larger than the sum of its proper divisors (1207369221).
233022222211 is a wasteful number, since it uses less digits than its factorization.
233022222211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1207369220.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 233022222211 its reverse (112222220332), we get a palindrome (345244442543).
The spelling of 233022222211 in words is "two hundred thirty-three billion, twenty-two million, two hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •