Base | Representation |
---|---|
bin | 1010000000010101111101… |
… | …1010110100001101111010 |
3 | 1102221200112110010012111110 |
4 | 2200011133122310031322 |
5 | 2420220033100011302 |
6 | 35221443432341150 |
7 | 2213540223033042 |
oct | 240053732641572 |
9 | 42850473105443 |
10 | 11001012110202 |
11 | 35615595a4324 |
12 | 12980a08447b6 |
13 | 61a51101142a |
14 | 2a0647b56722 |
15 | 14126547db6c |
hex | a015f6b437a |
11001012110202 has 8 divisors (see below), whose sum is σ = 22002024220416. Its totient is φ = 3667004036732.
The previous prime is 11001012110177. The next prime is 11001012110261. The reversal of 11001012110202 is 20201121010011.
11001012110202 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
11001012110202 is an admirable number.
It is a super-2 number, since 2×110010121102022 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 916751009178 + ... + 916751009189.
It is an arithmetic number, because the mean of its divisors is an integer number (2750253027552).
Almost surely, 211001012110202 is an apocalyptic number.
11001012110202 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.
11001012110202 is a wasteful number, since it uses less digits than its factorization.
11001012110202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1833502018372.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11001012110202 its reverse (20201121010011), we get a palindrome (31202133120213).
The spelling of 11001012110202 in words is "eleven trillion, one billion, twelve million, one hundred ten thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •