Base | Representation |
---|---|
bin | 1001001111001000011011… |
… | …10001100010010110000011 |
3 | 2122220201120200010212220002 |
4 | 10213210031301202112003 |
5 | 10130234144121313243 |
6 | 111110445512310215 |
7 | 4164300525404564 |
oct | 447441561422603 |
9 | 78821520125802 |
10 | 20311131432323 |
11 | 65209a2202186 |
12 | 23405249a236b |
13 | b44440337694 |
14 | 5030c78c416b |
15 | 2535148e6eb8 |
hex | 12790dc62583 |
20311131432323 has 8 divisors (see below), whose sum is σ = 20646562173840. Its totient is φ = 19975780090080.
The previous prime is 20311131432271. The next prime is 20311131432377. The reversal of 20311131432323 is 32323413111302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20311131432323 - 26 = 20311131432259 is a prime.
It is a super-2 number, since 2×203111314323232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20311131432223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19333865 + ... + 20357322.
It is an arithmetic number, because the mean of its divisors is an integer number (2580820271730).
Almost surely, 220311131432323 is an apocalyptic number.
20311131432323 is a deficient number, since it is larger than the sum of its proper divisors (335430741517).
20311131432323 is an equidigital number, since it uses as much as digits as its factorization.
20311131432323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39699637.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 20311131432323 its reverse (32323413111302), we get a palindrome (52634544543625).
The spelling of 20311131432323 in words is "twenty trillion, three hundred eleven billion, one hundred thirty-one million, four hundred thirty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •