Base | Representation |
---|---|
bin | 10100101100100010… |
… | …11111011000110010 |
3 | 1001200100111110112101 |
4 | 22112101133120302 |
5 | 140223420231002 |
6 | 5034313251014 |
7 | 542225544250 |
oct | 122621373062 |
9 | 31610443471 |
10 | 11111102002 |
11 | 4791a22430 |
12 | 21a1103a6a |
13 | 1080c57490 |
14 | 7759515d0 |
15 | 4506d8587 |
hex | 29645f632 |
11111102002 has 64 divisors (see below), whose sum is σ = 22800040704. Its totient is φ = 3920567040.
The previous prime is 11111101951. The next prime is 11111102059. The reversal of 11111102002 is 20020111111.
11111102002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 11111102002.
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 31 ways as a sum of consecutive naturals, for example, 53748 + ... + 158464.
It is an arithmetic number, because the mean of its divisors is an integer number (356250636).
Almost surely, 211111102002 is an apocalyptic number.
11111102002 is an abundant number, since it is smaller than the sum of its proper divisors (11688938702).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11111102002 is a wasteful number, since it uses less digits than its factorization.
11111102002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104803.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11111102002 its reverse (20020111111), we get a palindrome (31131213113).
The spelling of 11111102002 in words is "eleven billion, one hundred eleven million, one hundred two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •