Base | Representation |
---|---|
bin | 10100100000101000… |
… | …11110001010000110 |
3 | 1001102101112221022202 |
4 | 22100110132022012 |
5 | 140022333020402 |
6 | 5020344354502 |
7 | 536603553341 |
oct | 122024361206 |
9 | 31371487282 |
10 | 11011220102 |
11 | 4740601703 |
12 | 2173775a32 |
13 | 106635566c |
14 | 766591458 |
15 | 446a58b02 |
hex | 29051e286 |
11011220102 has 4 divisors (see below), whose sum is σ = 16516830156. Its totient is φ = 5505610050.
The previous prime is 11011220071. The next prime is 11011220111. The reversal of 11011220102 is 20102211011.
It is a semiprime because it is the product of two primes.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2752805024 + ... + 2752805027.
It is an arithmetic number, because the mean of its divisors is an integer number (4129207539).
Almost surely, 211011220102 is an apocalyptic number.
11011220102 is a deficient number, since it is larger than the sum of its proper divisors (5505610054).
11011220102 is an equidigital number, since it uses as much as digits as its factorization.
11011220102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5505610053.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11011220102 its reverse (20102211011), we get a palindrome (31113431113).
Subtracting 11011220102 from its reverse (20102211011), we obtain a palindrome (9090990909).
The spelling of 11011220102 in words is "eleven billion, eleven million, two hundred twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •