Base | Representation |
---|---|
bin | 1010000000111111101001… |
… | …0101111000100000000110 |
3 | 1102222202102020101212202020 |
4 | 2200033322111320200012 |
5 | 2420410442003020402 |
6 | 35230534014024010 |
7 | 2214414416635515 |
oct | 240177225704006 |
9 | 42882366355666 |
10 | 11012201220102 |
11 | 3566280557195 |
12 | 129a2a3aa8006 |
13 | 61b5a517c314 |
14 | 2a0dc9bb267c |
15 | 1416bc9258bc |
hex | a03fa578806 |
11012201220102 has 8 divisors (see below), whose sum is σ = 22024402440216. Its totient is φ = 3670733740032.
The previous prime is 11012201220089. The next prime is 11012201220133. The reversal of 11012201220102 is 20102210221011.
It is a sphenic number, since it is the product of 3 distinct primes.
11012201220102 is an admirable number.
It is a congruent number.
It is an unprimeable number.
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, 917683435003 + ... + 917683435014.
It is an arithmetic number, because the mean of its divisors is an integer number (2753050305027).
Almost surely, 211012201220102 is an apocalyptic number.
11012201220102 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.
11012201220102 is a wasteful number, since it uses less digits than its factorization.
11012201220102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1835366870022.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11012201220102 its reverse (20102210221011), we get a palindrome (31114411441113).
Subtracting 11012201220102 from its reverse (20102210221011), we obtain a palindrome (9090009000909).
The spelling of 11012201220102 in words is "eleven trillion, twelve billion, two hundred one million, two hundred twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •