Base | Representation |
---|---|
bin | 1001001001010101100010… |
… | …11001011110001101000101 |
3 | 2122012200121202220210120120 |
4 | 10210222301121132031011 |
5 | 10114003400324440141 |
6 | 110435155320052153 |
7 | 4144021301615511 |
oct | 444526131361505 |
9 | 78180552823516 |
10 | 20112013124421 |
11 | 64545030a9339 |
12 | 2309a14604059 |
13 | b2b7298a1a0a |
14 | 4d75d8955141 |
15 | 24d25da84c66 |
hex | 124ab165e345 |
20112013124421 has 8 divisors (see below), whose sum is σ = 26824421152704. Its totient is φ = 13403806922880.
The previous prime is 20112013124387. The next prime is 20112013124461. The reversal of 20112013124421 is 12442131021102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20112013124421 - 213 = 20112013116229 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20112013124391 and 20112013124400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112013124461) 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, 1050445516 + ... + 1050464661.
It is an arithmetic number, because the mean of its divisors is an integer number (3353052644088).
Almost surely, 220112013124421 is an apocalyptic number.
It is an amenable number.
20112013124421 is a deficient number, since it is larger than the sum of its proper divisors (6712408028283).
20112013124421 is a wasteful number, since it uses less digits than its factorization.
20112013124421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2100913371.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 20112013124421 its reverse (12442131021102), we get a palindrome (32554144145523).
The spelling of 20112013124421 in words is "twenty trillion, one hundred twelve billion, thirteen million, one hundred twenty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •