Base | Representation |
---|---|
bin | 1010000110000111001010… |
… | …1101011101010110101001 |
3 | 1110022011100110010021100110 |
4 | 2201201302231131112221 |
5 | 2423331021210342301 |
6 | 35335154050524533 |
7 | 2223646215223533 |
oct | 241416255352651 |
9 | 43264313107313 |
10 | 11100120012201 |
11 | 359a597404a50 |
12 | 12b333b896749 |
13 | 626976a6311c |
14 | 2a536a516853 |
15 | 143b161ed0d6 |
hex | a1872b5d5a9 |
11100120012201 has 16 divisors (see below), whose sum is σ = 16581997464768. Its totient is φ = 6545525313600.
The previous prime is 11100120012197. The next prime is 11100120012209. The reversal of 11100120012201 is 10221002100111.
11100120012201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11100120012201 - 22 = 11100120012197 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11100120012209) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4545502470 + ... + 4545504911.
It is an arithmetic number, because the mean of its divisors is an integer number (1036374841548).
Almost surely, 211100120012201 is an apocalyptic number.
11100120012201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11100120012201 is a deficient number, since it is larger than the sum of its proper divisors (5481877452567).
11100120012201 is a wasteful number, since it uses less digits than its factorization.
11100120012201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9091007432.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11100120012201 its reverse (10221002100111), we get a palindrome (21321122112312).
The spelling of 11100120012201 in words is "eleven trillion, one hundred billion, one hundred twenty million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •