Base | Representation |
---|---|
bin | 1001100110011000011101… |
… | …10001011110010100010101 |
3 | 2202202002122001002011110010 |
4 | 10303030032301132110111 |
5 | 10231331301100010401 |
6 | 112521450005550433 |
7 | 4306101531206535 |
oct | 463141661362425 |
9 | 82662561064403 |
10 | 21110012110101 |
11 | 67a9784554592 |
12 | 244b318415419 |
13 | ba18864295c5 |
14 | 52da3131b4c5 |
15 | 2691be7d7ed6 |
hex | 13330ec5e515 |
21110012110101 has 8 divisors (see below), whose sum is σ = 28146731471584. Its totient is φ = 14073317077680.
The previous prime is 21110012110079. The next prime is 21110012110111. The reversal of 21110012110101 is 10101121001112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21110012110101 - 27 = 21110012109973 is a prime.
It is a super-2 number, since 2×211100121101012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21110012110111) 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, 3950971 + ... + 7604616.
It is an arithmetic number, because the mean of its divisors is an integer number (3518341433948).
Almost surely, 221110012110101 is an apocalyptic number.
It is an amenable number.
21110012110101 is a deficient number, since it is larger than the sum of its proper divisors (7036719361483).
21110012110101 is a wasteful number, since it uses less digits than its factorization.
21110012110101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12164531.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 21110012110101 its reverse (10101121001112), we get a palindrome (31211133111213).
The spelling of 21110012110101 in words is "twenty-one trillion, one hundred ten billion, twelve million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •