Base | Representation |
---|---|
bin | 1010000111010001101011… |
… | …0100001010001100011010 |
3 | 1110101001222022000121012120 |
4 | 2201310122310022030122 |
5 | 2424143001233211302 |
6 | 35352302424322110 |
7 | 2225254642133643 |
oct | 241643264121432 |
9 | 43331868017176 |
10 | 11120120210202 |
11 | 35a801aa59803 |
12 | 12b71a1913336 |
13 | 6288134a9c03 |
14 | 2a63068506ca |
15 | 1443d6ea79bc |
hex | a1d1ad0a31a |
11120120210202 has 8 divisors (see below), whose sum is σ = 22240240420416. Its totient is φ = 3706706736732.
The previous prime is 11120120210167. The next prime is 11120120210209. The reversal of 11120120210202 is 20201202102111.
It is a sphenic number, since it is the product of 3 distinct primes.
11120120210202 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (11120120210209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 926676684178 + ... + 926676684189.
It is an arithmetic number, because the mean of its divisors is an integer number (2780030052552).
Almost surely, 211120120210202 is an apocalyptic number.
11120120210202 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.
11120120210202 is a wasteful number, since it uses less digits than its factorization.
11120120210202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1853353368372.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11120120210202 its reverse (20201202102111), we get a palindrome (31321322312313).
The spelling of 11120120210202 in words is "eleven trillion, one hundred twenty billion, one hundred twenty million, two hundred ten thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •