Base | Representation |
---|---|
bin | 1010100110110010101100… |
… | …10010011110101101000011 |
3 | 10001120200001100012200200212 |
4 | 11103121112102132231003 |
5 | 11024111222221232321 |
6 | 121334254330504335 |
7 | 4625016441566216 |
oct | 523312622365503 |
9 | 101520040180625 |
10 | 23323120102211 |
11 | 74823092a0aa6 |
12 | 27482158950ab |
13 | 100248c862c97 |
14 | 5a8bb8ac977d |
15 | 2a6a4b8be55b |
hex | 15365649eb43 |
23323120102211 has 4 divisors (see below), whose sum is σ = 23325924381312. Its totient is φ = 23320315823112.
The previous prime is 23323120102199. The next prime is 23323120102241. The reversal of 23323120102211 is 11220102132332.
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-23323120102211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23323120102241) 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, 1402127075 + ... + 1402143708.
It is an arithmetic number, because the mean of its divisors is an integer number (5831481095328).
Almost surely, 223323120102211 is an apocalyptic number.
23323120102211 is a deficient number, since it is larger than the sum of its proper divisors (2804279101).
23323120102211 is an equidigital number, since it uses as much as digits as its factorization.
23323120102211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2804279100.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 23323120102211 its reverse (11220102132332), we get a palindrome (34543222234543).
The spelling of 23323120102211 in words is "twenty-three trillion, three hundred twenty-three billion, one hundred twenty million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •