Base | Representation |
---|---|
bin | 100000010011101111011… |
… | …011001101011001000101 |
3 | 21212020202221122120120120 |
4 | 200103233123031121011 |
5 | 242334002310341401 |
6 | 4415542140052153 |
7 | 316256056502460 |
oct | 40235733153105 |
9 | 7766687576516 |
10 | 2220220012101 |
11 | 786654352393 |
12 | 2ba363234059 |
13 | 13149aa01240 |
14 | 796601682d7 |
15 | 3cb4667b836 |
hex | 204ef6cd645 |
2220220012101 has 64 divisors (see below), whose sum is σ = 3745795350528. Its totient is φ = 1138270226688.
The previous prime is 2220220012097. The next prime is 2220220012147. The reversal of 2220220012101 is 1012100220222.
2220220012101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2220220012101 - 22 = 2220220012097 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2220220012151) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 9654016 + ... + 9881318.
It is an arithmetic number, because the mean of its divisors is an integer number (58528052352).
Almost surely, 22220220012101 is an apocalyptic number.
2220220012101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2220220012101 is a deficient number, since it is larger than the sum of its proper divisors (1525575338427).
2220220012101 is a wasteful number, since it uses less digits than its factorization.
2220220012101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228330.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2220220012101 its reverse (1012100220222), we get a palindrome (3232320232323).
The spelling of 2220220012101 in words is "two trillion, two hundred twenty billion, two hundred twenty million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •