Base | Representation |
---|---|
bin | 1001001001010111011100… |
… | …01100011111011111110101 |
3 | 2122012210020212020112221211 |
4 | 10210223232030133133311 |
5 | 10114012442440211041 |
6 | 110435444434241421 |
7 | 4144055465546554 |
oct | 444535614373765 |
9 | 78183225215854 |
10 | 20113033132021 |
11 | 6454986948125 |
12 | 230a05a126271 |
13 | b2b85ccc58cb |
14 | 4d76941cdd9b |
15 | 24d2bd3b9481 |
hex | 124aee31f7f5 |
20113033132021 has 8 divisors (see below), whose sum is σ = 21171672063200. Its totient is φ = 19054400024880.
The previous prime is 20113033131973. The next prime is 20113033132043. The reversal of 20113033132021 is 12023133031102.
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 20113033132021 - 221 = 20113031034869 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20113033131983 and 20113033132001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20113033133021) 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, 6846691 + ... + 9332911.
It is an arithmetic number, because the mean of its divisors is an integer number (2646459007900).
Almost surely, 220113033132021 is an apocalyptic number.
It is an amenable number.
20113033132021 is a deficient number, since it is larger than the sum of its proper divisors (1058638931179).
20113033132021 is a wasteful number, since it uses less digits than its factorization.
20113033132021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2912019.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 20113033132021 its reverse (12023133031102), we get a palindrome (32136166163123).
The spelling of 20113033132021 in words is "twenty trillion, one hundred thirteen billion, thirty-three million, one hundred thirty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •