Base | Representation |
---|---|
bin | 1001001001010101111110… |
… | …00000011001001101110101 |
3 | 2122012201012200111222220002 |
4 | 10210222333000121031311 |
5 | 10114004332301301123 |
6 | 110435234113321045 |
7 | 4144030043320535 |
oct | 444527700311565 |
9 | 78181180458802 |
10 | 20112241431413 |
11 | 645460aa657aa |
12 | 2309a78b66185 |
13 | b2b764c8a501 |
14 | 4d761adc54c5 |
15 | 24d273b31528 |
hex | 124abf019375 |
20112241431413 has 4 divisors (see below), whose sum is σ = 20112290866848. Its totient is φ = 20112191995980.
The previous prime is 20112241431407. The next prime is 20112241431473. The reversal of 20112241431413 is 31413414221102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20112241431413 - 216 = 20112241365877 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 (20112241431473) 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, 24102353 + ... + 24922838.
It is an arithmetic number, because the mean of its divisors is an integer number (5028072716712).
Almost surely, 220112241431413 is an apocalyptic number.
It is an amenable number.
20112241431413 is a deficient number, since it is larger than the sum of its proper divisors (49435435).
20112241431413 is an equidigital number, since it uses as much as digits as its factorization.
20112241431413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49435434.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 20112241431413 its reverse (31413414221102), we get a palindrome (51525655652515).
The spelling of 20112241431413 in words is "twenty trillion, one hundred twelve billion, two hundred forty-one million, four hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •