Base | Representation |
---|---|
bin | 1001010010000010110000… |
… | …00011111011010111101011 |
3 | 2200021021202222022222222100 |
4 | 10221001120003323113223 |
5 | 10133404024433441321 |
6 | 111224431451024443 |
7 | 4204441423340202 |
oct | 451013003732753 |
9 | 80237688288870 |
10 | 20411162015211 |
11 | 655a3639266a0 |
12 | 23579a0a3b123 |
13 | b509c22944b6 |
14 | 507c96a26239 |
15 | 255e1b673326 |
hex | 1290580fb5eb |
20411162015211 has 48 divisors (see below), whose sum is σ = 32601456081792. Its totient is φ = 12202818566400.
The previous prime is 20411162015201. The next prime is 20411162015239. The reversal of 20411162015211 is 11251026111402.
20411162015211 is a `hidden beast` number, since 2 + 0 + 4 + 1 + 1 + 1 + 620 + 15 + 21 + 1 = 666.
It is not a de Polignac number, because 20411162015211 - 233 = 20402572080619 is a prime.
It is a super-2 number, since 2×204111620152112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20411162015201) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1963105 + ... + 6684018.
It is an arithmetic number, because the mean of its divisors is an integer number (679197001704).
Almost surely, 220411162015211 is an apocalyptic number.
20411162015211 is a deficient number, since it is larger than the sum of its proper divisors (12190294066581).
20411162015211 is a wasteful number, since it uses less digits than its factorization.
20411162015211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8647464 (or 8647461 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 27.
Adding to 20411162015211 its reverse (11251026111402), we get a palindrome (31662188126613).
The spelling of 20411162015211 in words is "twenty trillion, four hundred eleven billion, one hundred sixty-two million, fifteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •