Base | Representation |
---|---|
bin | 1001100110011000011110… |
… | …10111001111010010100101 |
3 | 2202202002122201201010120211 |
4 | 10303030033113033102211 |
5 | 10231331311113310041 |
6 | 112521451002055421 |
7 | 4306102011311350 |
oct | 463141727172245 |
9 | 82662581633524 |
10 | 21110022010021 |
11 | 67a978a0a653a |
12 | 244b31b7aa571 |
13 | ba18884b4749 |
14 | 52da32777297 |
15 | 2691c05e1481 |
hex | 13330f5cf4a5 |
21110022010021 has 16 divisors (see below), whose sum is σ = 24972723843840. Its totient is φ = 17459819395200.
The previous prime is 21110022009997. The next prime is 21110022010061. The reversal of 21110022010021 is 12001022001112.
It is not a de Polignac number, because 21110022010021 - 221 = 21110019912869 is a prime.
It is a super-2 number, since 2×211100220100212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21110022009983 and 21110022010010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21110022010061) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31042705 + ... + 31715446.
It is an arithmetic number, because the mean of its divisors is an integer number (1560795240240).
Almost surely, 221110022010021 is an apocalyptic number.
It is an amenable number.
21110022010021 is a deficient number, since it is larger than the sum of its proper divisors (3862701833819).
21110022010021 is a wasteful number, since it uses less digits than its factorization.
21110022010021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62759844.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 21110022010021 its reverse (12001022001112), we get a palindrome (33111044011133).
The spelling of 21110022010021 in words is "twenty-one trillion, one hundred ten billion, twenty-two million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •