Base | Representation |
---|---|
bin | 10100101011011110… |
… | …01010001100100110 |
3 | 1001122201120020021110 |
4 | 22111233022030212 |
5 | 140214114233220 |
6 | 5033352325450 |
7 | 542056212135 |
oct | 122557121446 |
9 | 31581506243 |
10 | 11102102310 |
11 | 4787935872 |
12 | 219a0a3886 |
13 | 107c126010 |
14 | 77468b91c |
15 | 44ea0bbe0 |
hex | 295bca326 |
11102102310 has 32 divisors (see below), whose sum is σ = 28694665440. Its totient is φ = 2732825088.
The previous prime is 11102102299. The next prime is 11102102351. The reversal of 11102102310 is 1320120111.
11102102310 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×111021023102 (a number of 21 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 14233075 + ... + 14233854.
It is an arithmetic number, because the mean of its divisors is an integer number (896708295).
Almost surely, 211102102310 is an apocalyptic number.
11102102310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11102102310 is an abundant number, since it is smaller than the sum of its proper divisors (17592563130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11102102310 is a wasteful number, since it uses less digits than its factorization.
11102102310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28466952.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 11102102310 its reverse (1320120111), we get a palindrome (12422222421).
The spelling of 11102102310 in words is "eleven billion, one hundred two million, one hundred two thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •