Base | Representation |
---|---|
bin | 1010100001001111000101… |
… | …01000010100110111100011 |
3 | 10000220102020212110001101201 |
4 | 11100213202220110313203 |
5 | 11012444221441023021 |
6 | 121110441514142031 |
7 | 4605150336130426 |
oct | 520474250246743 |
9 | 100812225401351 |
10 | 23132201111011 |
11 | 7409347521153 |
12 | 2717213421917 |
13 | cba484a186c5 |
14 | 59d866aa99bd |
15 | 2a1ac57c9591 |
hex | 1509e2a14de3 |
23132201111011 has 4 divisors (see below), whose sum is σ = 23141795556024. Its totient is φ = 23122606666000.
The previous prime is 23132201110979. The next prime is 23132201111017. The reversal of 23132201111011 is 11011110223132.
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 23132201111011 - 25 = 23132201110979 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 23132201111011.
It is not an unprimeable number, because it can be changed into a prime (23132201111017) 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, 4797218890 + ... + 4797223711.
It is an arithmetic number, because the mean of its divisors is an integer number (5785448889006).
Almost surely, 223132201111011 is an apocalyptic number.
23132201111011 is a deficient number, since it is larger than the sum of its proper divisors (9594445013).
23132201111011 is an equidigital number, since it uses as much as digits as its factorization.
23132201111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9594445012.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 23132201111011 its reverse (11011110223132), we get a palindrome (34143311334143).
The spelling of 23132201111011 in words is "twenty-three trillion, one hundred thirty-two billion, two hundred one million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •