Base | Representation |
---|---|
bin | 1010001100000011001001… |
… | …1101000111011000111011 |
3 | 1110122220122002100112211122 |
4 | 2203000302131013120323 |
5 | 2432013421011414321 |
6 | 35454103342215455 |
7 | 2234220002065403 |
oct | 243006235073073 |
9 | 43586562315748 |
10 | 11202121201211 |
11 | 362987a419a66 |
12 | 130b06788458b |
13 | 633481045175 |
14 | 2aa285261803 |
15 | 1465d5e828ab |
hex | a303274763b |
11202121201211 has 8 divisors (see below), whose sum is σ = 11260907731200. Its totient is φ = 11143336095360.
The previous prime is 11202121201199. The next prime is 11202121201231. The reversal of 11202121201211 is 11210212120211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11202121201211 - 26 = 11202121201147 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11202121201211.
It is not an unprimeable number, because it can be changed into a prime (11202121201231) 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, 17853605 + ... + 18470393.
It is an arithmetic number, because the mean of its divisors is an integer number (1407613466400).
Almost surely, 211202121201211 is an apocalyptic number.
11202121201211 is a deficient number, since it is larger than the sum of its proper divisors (58786529989).
11202121201211 is an equidigital number, since it uses as much as digits as its factorization.
11202121201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 712069.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11202121201211 its reverse (11210212120211), we get a palindrome (22412333321422).
The spelling of 11202121201211 in words is "eleven trillion, two hundred two billion, one hundred twenty-one million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •