Base | Representation |
---|---|
bin | 1000001100110000… |
… | …1110111000111011 |
3 | 12200101121111120202 |
4 | 2003030032320323 |
5 | 14001430201021 |
6 | 1002223312415 |
7 | 105354243536 |
oct | 20314167073 |
9 | 5611544522 |
10 | 2201022011 |
11 | a2a468461 |
12 | 51514b70b |
13 | 290ccb8b6 |
14 | 16c465a1d |
15 | cd36ea0b |
hex | 8330ee3b |
2201022011 has 8 divisors (see below), whose sum is σ = 2331053280. Its totient is φ = 2071052928.
The previous prime is 2201021989. The next prime is 2201022013. The reversal of 2201022011 is 1102201022.
It is a happy number.
2201022011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2201022011 - 214 = 2201005627 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2201021983 and 2201022001.
It is not an unprimeable number, because it can be changed into a prime (2201022013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71210 + ... + 97328.
It is an arithmetic number, because the mean of its divisors is an integer number (291381660).
Almost surely, 22201022011 is an apocalyptic number.
2201022011 is a deficient number, since it is larger than the sum of its proper divisors (130031269).
2201022011 is a wasteful number, since it uses less digits than its factorization.
2201022011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31093.
The product of its (nonzero) digits is 16, while the sum is 11.
The square root of 2201022011 is about 46915.0510071128. The cubic root of 2201022011 is about 1300.7928124557.
Adding to 2201022011 its reverse (1102201022), we get a palindrome (3303223033).
The spelling of 2201022011 in words is "two billion, two hundred one million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •