Base | Representation |
---|---|
bin | 1001001001010101100010… |
… | …11001000100110100001111 |
3 | 2122012200121202201111221002 |
4 | 10210222301121010310033 |
5 | 10114003400313123211 |
6 | 110435155313530515 |
7 | 4144021301003363 |
oct | 444526131046417 |
9 | 78180552644832 |
10 | 20112013020431 |
11 | 64545030381a2 |
12 | 2309a14573a3b |
13 | b2b729866597 |
14 | 4d75d89292a3 |
15 | 24d25da6403b |
hex | 124ab1644d0f |
20112013020431 has 4 divisors (see below), whose sum is σ = 20112294603192. Its totient is φ = 20111731437672.
The previous prime is 20112013020377. The next prime is 20112013020529. The reversal of 20112013020431 is 13402031021102.
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 20112013020431 - 222 = 20112008826127 is a prime.
It is a super-2 number, since 2×201120130204312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112013025431) 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, 140684216 + ... + 140827101.
It is an arithmetic number, because the mean of its divisors is an integer number (5028073650798).
Almost surely, 220112013020431 is an apocalyptic number.
20112013020431 is a deficient number, since it is larger than the sum of its proper divisors (281582761).
20112013020431 is an equidigital number, since it uses as much as digits as its factorization.
20112013020431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 281582760.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 20112013020431 its reverse (13402031021102), we get a palindrome (33514044041533).
The spelling of 20112013020431 in words is "twenty trillion, one hundred twelve billion, thirteen million, twenty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •