Base | Representation |
---|---|
bin | 1010000110010010101001… |
… | …1110100101110001111110 |
3 | 1110022110022022112111022110 |
4 | 2201210222132211301332 |
5 | 2423403324444403202 |
6 | 35340424024354450 |
7 | 2224115503224654 |
oct | 241445236456176 |
9 | 43273268474273 |
10 | 11103203122302 |
11 | 35a0929780225 |
12 | 12b3a60315a26 |
13 | 627048726525 |
14 | 2a557db94dd4 |
15 | 143c46c0c26c |
hex | a192a7a5c7e |
11103203122302 has 64 divisors (see below), whose sum is σ = 22907857867776. Its totient is φ = 3585940425600.
The previous prime is 11103203122289. The next prime is 11103203122303. The reversal of 11103203122302 is 20322130230111.
It is a super-2 number, since 2×111032031223022 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11103203122303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 61962828 + ... + 62141760.
It is an arithmetic number, because the mean of its divisors is an integer number (357935279184).
Almost surely, 211103203122302 is an apocalyptic number.
11103203122302 is an abundant number, since it is smaller than the sum of its proper divisors (11804654745474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11103203122302 is a wasteful number, since it uses less digits than its factorization.
11103203122302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181425.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 11103203122302 its reverse (20322130230111), we get a palindrome (31425333352413).
The spelling of 11103203122302 in words is "eleven trillion, one hundred three billion, two hundred three million, one hundred twenty-two thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •