Base | Representation |
---|---|
bin | 1000001100110010… |
… | …0010001101000010 |
3 | 12200101202112002210 |
4 | 2003030202031002 |
5 | 14001440213442 |
6 | 1002225122550 |
7 | 105355023303 |
oct | 20314421502 |
9 | 5611675083 |
10 | 2201101122 |
11 | a2a511940 |
12 | 515189456 |
13 | 2910288cc |
14 | 16c4867aa |
15 | cd38819c |
hex | 83322342 |
2201101122 has 32 divisors (see below), whose sum is σ = 4957323264. Its totient is φ = 645483600.
The previous prime is 2201101099. The next prime is 2201101139. The reversal of 2201101122 is 2211011022.
It is a super-2 number, since 2×22011011222 = 9689692298539317768, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2201101098 and 2201101107.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 535858 + ... + 539949.
It is an arithmetic number, because the mean of its divisors is an integer number (154916352).
Almost surely, 22201101122 is an apocalyptic number.
2201101122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2201101122 is an abundant number, since it is smaller than the sum of its proper divisors (2756222142).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2201101122 is a wasteful number, since it uses less digits than its factorization.
2201101122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1075854.
The product of its (nonzero) digits is 16, while the sum is 12.
The square root of 2201101122 is about 46915.8941298149. The cubic root of 2201101122 is about 1300.8083970019.
Adding to 2201101122 its reverse (2211011022), we get a palindrome (4412112144).
The spelling of 2201101122 in words is "two billion, two hundred one million, one hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •