Base | Representation |
---|---|
bin | 1010000000111011111101… |
… | …0101010000111010011001 |
3 | 1102222122212020111202111120 |
4 | 2200032333111100322121 |
5 | 2420401430031432301 |
6 | 35230251450315453 |
7 | 2214351035631120 |
oct | 240167725207231 |
9 | 42878766452446 |
10 | 11011211202201 |
11 | 3565912731081 |
12 | 129a068428b89 |
13 | 61b478028802 |
14 | 2a0d34502ab7 |
15 | 141660a66e36 |
hex | a03bf550e99 |
11011211202201 has 8 divisors (see below), whose sum is σ = 16778988498624. Its totient is φ = 6292120686960.
The previous prime is 11011211202163. The next prime is 11011211202209. The reversal of 11011211202201 is 10220211211011.
It is a happy number.
11011211202201 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.
It is not a de Polignac number, because 11011211202201 - 233 = 11002621267609 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11011211202209) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 262171695270 + ... + 262171695311.
It is an arithmetic number, because the mean of its divisors is an integer number (2097373562328).
Almost surely, 211011211202201 is an apocalyptic number.
It is an amenable number.
11011211202201 is a deficient number, since it is larger than the sum of its proper divisors (5767777296423).
11011211202201 is an equidigital number, since it uses as much as digits as its factorization.
11011211202201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 524343390591.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11011211202201 its reverse (10220211211011), we get a palindrome (21231422413212).
The spelling of 11011211202201 in words is "eleven trillion, eleven billion, two hundred eleven million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •