Base | Representation |
---|---|
bin | 1010011101011010111010… |
… | …01010111100101010110111 |
3 | 10000102212220010002010000222 |
4 | 11032231131022330222313 |
5 | 11003322234413133421 |
6 | 120530322045324555 |
7 | 4562530010553341 |
oct | 516553512745267 |
9 | 100385803063028 |
10 | 23001113021111 |
11 | 7368798731a75 |
12 | 26b592a26675b |
13 | caacc35a32c4 |
14 | 59738ccc2291 |
15 | 29d4a2183cab |
hex | 14eb5d2bcab7 |
23001113021111 has 4 divisors (see below), whose sum is σ = 23041536770400. Its totient is φ = 22960689271824.
The previous prime is 23001113021071. The next prime is 23001113021143. The reversal of 23001113021111 is 11112031110032.
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-23001113021111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23001113021111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23001113021191) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20211873791 + ... + 20211874928.
It is an arithmetic number, because the mean of its divisors is an integer number (5760384192600).
Almost surely, 223001113021111 is an apocalyptic number.
23001113021111 is a deficient number, since it is larger than the sum of its proper divisors (40423749289).
23001113021111 is an equidigital number, since it uses as much as digits as its factorization.
23001113021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40423749288.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 23001113021111 its reverse (11112031110032), we get a palindrome (34113144131143).
The spelling of 23001113021111 in words is "twenty-three trillion, one billion, one hundred thirteen million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.139 sec. • engine limits •