Base | Representation |
---|---|
bin | 1001010010101010010111… |
… | …11000001010011100101011 |
3 | 2200100022200100101120221221 |
4 | 10221111023320022130223 |
5 | 10134231110201104011 |
6 | 111242310242042511 |
7 | 4206123503101564 |
oct | 451251370123453 |
9 | 80308610346857 |
10 | 20432432441131 |
11 | 6568389493497 |
12 | 235bb38349437 |
13 | b52a01c20c39 |
14 | 508d1393116b |
15 | 256763bdb971 |
hex | 12954be0a72b |
20432432441131 has 8 divisors (see below), whose sum is σ = 20769889648928. Its totient is φ = 20095055856000.
The previous prime is 20432432441111. The next prime is 20432432441173. The reversal of 20432432441131 is 13114423423402.
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 20432432441131 - 219 = 20432431916843 is a prime.
It is a super-2 number, since 2×204324324411312 (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 (20432432441111) 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, 19644510 + ... + 20658451.
It is an arithmetic number, because the mean of its divisors is an integer number (2596236206116).
Almost surely, 220432432441131 is an apocalyptic number.
20432432441131 is a deficient number, since it is larger than the sum of its proper divisors (337457207797).
20432432441131 is an equidigital number, since it uses as much as digits as its factorization.
20432432441131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40311333.
The product of its (nonzero) digits is 55296, while the sum is 34.
Adding to 20432432441131 its reverse (13114423423402), we get a palindrome (33546855864533).
The spelling of 20432432441131 in words is "twenty trillion, four hundred thirty-two billion, four hundred thirty-two million, four hundred forty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •