Base | Representation |
---|---|
bin | 10100100000101000… |
… | …11110101010111101 |
3 | 1001102101120001012122 |
4 | 22100110132222331 |
5 | 140022333102310 |
6 | 5020344412325 |
7 | 536603562434 |
oct | 122024365275 |
9 | 31371501178 |
10 | 11011222205 |
11 | 4740603245 |
12 | 21737770a5 |
13 | 10663565c9 |
14 | 76659211b |
15 | 446a59555 |
hex | 29051eabd |
11011222205 has 8 divisors (see below), whose sum is σ = 13520756832. Its totient is φ = 8604117648.
The previous prime is 11011222139. The next prime is 11011222223. The reversal of 11011222205 is 50222211011.
11011222205 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 11011222205 - 230 = 9937480381 is a prime.
It is a super-3 number, since 3×110112222053 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25607279 + ... + 25607708.
It is an arithmetic number, because the mean of its divisors is an integer number (1690094604).
Almost surely, 211011222205 is an apocalyptic number.
It is an amenable number.
11011222205 is a deficient number, since it is larger than the sum of its proper divisors (2509534627).
11011222205 is an equidigital number, since it uses as much as digits as its factorization.
11011222205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51215035.
The product of its (nonzero) digits is 80, while the sum is 17.
Adding to 11011222205 its reverse (50222211011), we get a palindrome (61233433216).
The spelling of 11011222205 in words is "eleven billion, eleven million, two hundred twenty-two thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •