Base | Representation |
---|---|
bin | 11110100100101101011… |
… | …011100111011110000100 |
3 | 21102212001101110112121211 |
4 | 132210231123213132010 |
5 | 233410322303101040 |
6 | 4245104151421204 |
7 | 304535524504141 |
oct | 36445533473604 |
9 | 7385041415554 |
10 | 2101001222020 |
11 | 7400364648a8 |
12 | 29b231084804 |
13 | 12317b61b27c |
14 | 739908993c8 |
15 | 399ba08a8ea |
hex | 1e92d6e7784 |
2101001222020 has 48 divisors (see below), whose sum is σ = 4506271999488. Its totient is φ = 822465795200.
The previous prime is 2101001222017. The next prime is 2101001222041. The reversal of 2101001222020 is 202221001012.
It is a happy number.
It is a super-2 number, since 2×21010012220202 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16228545 + ... + 16357495.
It is an arithmetic number, because the mean of its divisors is an integer number (93880666656).
Almost surely, 22101001222020 is an apocalyptic number.
2101001222020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2101001222020 is an abundant number, since it is smaller than the sum of its proper divisors (2405270777468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2101001222020 is a wasteful number, since it uses less digits than its factorization.
2101001222020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146340 (or 146338 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 2101001222020 its reverse (202221001012), we get a palindrome (2303222223032).
The spelling of 2101001222020 in words is "two trillion, one hundred one billion, one million, two hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •