Base | Representation |
---|---|
bin | 1010100110101101010010… |
… | …11111101100111101011111 |
3 | 10001120101120022020122011002 |
4 | 11103112221133230331133 |
5 | 11024034303101010421 |
6 | 121333054531220515 |
7 | 4624554550554212 |
oct | 523265137547537 |
9 | 101511508218132 |
10 | 23320221110111 |
11 | 7481060950362 |
12 | 2747746a4773b |
13 | 100211a085c43 |
14 | 5a89c1a97779 |
15 | 2a692c12db0b |
hex | 1535a97ecf5f |
23320221110111 has 4 divisors (see below), whose sum is σ = 23321048595312. Its totient is φ = 23319393624912.
The previous prime is 23320221110089. The next prime is 23320221110141. The reversal of 23320221110111 is 11101112202332.
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 23320221110111 - 26 = 23320221110047 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 (23320221110141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 413700326 + ... + 413756691.
It is an arithmetic number, because the mean of its divisors is an integer number (5830262148828).
Almost surely, 223320221110111 is an apocalyptic number.
23320221110111 is a deficient number, since it is larger than the sum of its proper divisors (827485201).
23320221110111 is an equidigital number, since it uses as much as digits as its factorization.
23320221110111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 827485200.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 23320221110111 its reverse (11101112202332), we get a palindrome (34421333312443).
The spelling of 23320221110111 in words is "twenty-three trillion, three hundred twenty billion, two hundred twenty-one million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •