Base | Representation |
---|---|
bin | 1001001100110101101000… |
… | …10100000001010010010111 |
3 | 2122122012011020121202111102 |
4 | 10212122310110001102113 |
5 | 10122441243201024231 |
6 | 111010333333500315 |
7 | 4155510530623520 |
oct | 446326424012227 |
9 | 78565136552442 |
10 | 20232321111191 |
11 | 64a052a8a2482 |
12 | 23291ab4a169b |
13 | b39b90822277 |
14 | 4dd36cb4d847 |
15 | 251450ac5acb |
hex | 1266b4501497 |
20232321111191 has 8 divisors (see below), whose sum is σ = 23123140702080. Its totient is φ = 17341623521208.
The previous prime is 20232321111161. The next prime is 20232321111199. The reversal of 20232321111191 is 19111112323202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20232321111191 - 218 = 20232320849047 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 (20232321111199) 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 7 ways as a sum of consecutive naturals, for example, 30144581 + ... + 30808446.
It is an arithmetic number, because the mean of its divisors is an integer number (2890392587760).
Almost surely, 220232321111191 is an apocalyptic number.
20232321111191 is a deficient number, since it is larger than the sum of its proper divisors (2890819590889).
20232321111191 is an equidigital number, since it uses as much as digits as its factorization.
20232321111191 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61000453.
The product of its (nonzero) digits is 1296, while the sum is 29.
Adding to 20232321111191 its reverse (19111112323202), we get a palindrome (39343433434393).
The spelling of 20232321111191 in words is "twenty trillion, two hundred thirty-two billion, three hundred twenty-one million, one hundred eleven thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •