Base | Representation |
---|---|
bin | 1001100011100000000100… |
… | …11100110010011010101001 |
3 | 2202101122010012001110222012 |
4 | 10301300002130302122221 |
5 | 10223221032401104001 |
6 | 112404155125205305 |
7 | 4265665455466463 |
oct | 461600234623251 |
9 | 82348105043865 |
10 | 21011021113001 |
11 | 67707a6731287 |
12 | 24340b0560835 |
13 | b9543b989aca |
14 | 528d202ad133 |
15 | 266828e5c2bb |
hex | 131c027326a9 |
21011021113001 has 16 divisors (see below), whose sum is σ = 22233840139008. Its totient is φ = 19813989518400.
The previous prime is 21011021112923. The next prime is 21011021113013. The reversal of 21011021113001 is 10031112011012.
It is a cyclic number.
It is not a de Polignac number, because 21011021113001 - 218 = 21011020850857 is a prime.
It is a super-2 number, since 2×210110211130012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21011021113601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 89496911 + ... + 89731371.
It is an arithmetic number, because the mean of its divisors is an integer number (1389615008688).
Almost surely, 221011021113001 is an apocalyptic number.
It is an amenable number.
21011021113001 is a deficient number, since it is larger than the sum of its proper divisors (1222819026007).
21011021113001 is a wasteful number, since it uses less digits than its factorization.
21011021113001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 289432.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 21011021113001 its reverse (10031112011012), we get a palindrome (31042133124013).
The spelling of 21011021113001 in words is "twenty-one trillion, eleven billion, twenty-one million, one hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •