Base | Representation |
---|---|
bin | 10100011111101010… |
… | …01110101000000110 |
3 | 1001101211010211122110 |
4 | 22033311032220012 |
5 | 140013233430042 |
6 | 5015453041450 |
7 | 536444132505 |
oct | 121765165006 |
9 | 31354124573 |
10 | 11003030022 |
11 | 4736a18346 |
12 | 2170a86286 |
13 | 106474886a |
14 | 76545c83c |
15 | 445e8c09c |
hex | 28fd4ea06 |
11003030022 has 8 divisors (see below), whose sum is σ = 22006060056. Its totient is φ = 3667676672.
The previous prime is 11003030009. The next prime is 11003030029. The reversal of 11003030022 is 22003030011.
It is a happy number.
11003030022 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.
11003030022 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11003030029) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 916919163 + ... + 916919174.
It is an arithmetic number, because the mean of its divisors is an integer number (2750757507).
Almost surely, 211003030022 is an apocalyptic number.
11003030022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11003030022 is a wasteful number, since it uses less digits than its factorization.
11003030022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1833838342.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 11003030022 its reverse (22003030011), we get a palindrome (33006060033).
The spelling of 11003030022 in words is "eleven billion, three million, thirty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •