Base | Representation |
---|---|
bin | 11101010001000110000… |
… | …011011100000011111101 |
3 | 21010021022101020221212110 |
4 | 131101012003130003331 |
5 | 230422434310013041 |
6 | 4135535224324233 |
7 | 265206622640220 |
oct | 35210603340375 |
9 | 7107271227773 |
10 | 2011220001021 |
11 | 705a54292700 |
12 | 285955613679 |
13 | 117870c29a2a |
14 | 6d4b4a6b5b7 |
15 | 374b3027516 |
hex | 1d4460dc0fd |
2011220001021 has 24 divisors (see below), whose sum is σ = 3368654992192. Its totient is φ = 1044789609600.
The previous prime is 2011220000963. The next prime is 2011220001023. The reversal of 2011220001021 is 1201000221102.
It is not a de Polignac number, because 2011220001021 - 213 = 2011219992829 is a prime.
It is a super-2 number, since 2×20112200010212 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2011220000988 and 2011220001006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011220001023) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 395751100 + ... + 395756181.
Almost surely, 22011220001021 is an apocalyptic number.
2011220001021 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2011220001021 is a deficient number, since it is larger than the sum of its proper divisors (1357434991171).
2011220001021 is a wasteful number, since it uses less digits than its factorization.
2011220001021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 791507313 (or 791507302 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2011220001021 its reverse (1201000221102), we get a palindrome (3212220222123).
The spelling of 2011220001021 in words is "two trillion, eleven billion, two hundred twenty million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •