Base | Representation |
---|---|
bin | 1001000110010111100101… |
… | …11010101010101000100101 |
3 | 2121211221101121120022121221 |
4 | 10203023302322222220211 |
5 | 10110321021440130041 |
6 | 110320252102540341 |
7 | 4133451163146544 |
oct | 443136272525045 |
9 | 77757347508557 |
10 | 20010033130021 |
11 | 6415231050130 |
12 | 22b20b37376b1 |
13 | b21c26b00a6c |
14 | 4d26c296615b |
15 | 24a790ada2d1 |
hex | 1232f2eaaa25 |
20010033130021 has 8 divisors (see below), whose sum is σ = 22128156189504. Its totient is φ = 17941748260320.
The previous prime is 20010033129937. The next prime is 20010033130039. The reversal of 20010033130021 is 12003133001002.
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 20010033130021 - 225 = 20009999575589 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20010033129977 and 20010033130004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20010033130921) 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, 12459546601 + ... + 12459548206.
It is an arithmetic number, because the mean of its divisors is an integer number (2766019523688).
Almost surely, 220010033130021 is an apocalyptic number.
It is an amenable number.
20010033130021 is a deficient number, since it is larger than the sum of its proper divisors (2118123059483).
20010033130021 is a wasteful number, since it uses less digits than its factorization.
20010033130021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24919094891.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 20010033130021 its reverse (12003133001002), we get a palindrome (32013166131023).
The spelling of 20010033130021 in words is "twenty trillion, ten billion, thirty-three million, one hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •