Base | Representation |
---|---|
bin | 1010001100000011011100… |
… | …1101100100010000000001 |
3 | 1110122220211122112022120012 |
4 | 2203000313031210100001 |
5 | 2432014101424324301 |
6 | 35454115312554305 |
7 | 2234221661340524 |
oct | 243006715442001 |
9 | 43586748468505 |
10 | 11202201011201 |
11 | 3629910480432 |
12 | 130b08a552995 |
13 | 633494739c05 |
14 | 2aa291ab8bbb |
15 | 1465dce99ebb |
hex | a3037364401 |
11202201011201 has 8 divisors (see below), whose sum is σ = 11370912134400. Its totient is φ = 11033793600480.
The previous prime is 11202201011189. The next prime is 11202201011213. The reversal of 11202201011201 is 10211010220211.
It is an interprime number because it is at equal distance from previous prime (11202201011189) and next prime (11202201011213).
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 11202201011201 - 210 = 11202201010177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11202201011251) 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, 75853796 + ... + 76001333.
It is an arithmetic number, because the mean of its divisors is an integer number (1421364016800).
Almost surely, 211202201011201 is an apocalyptic number.
It is an amenable number.
11202201011201 is a deficient number, since it is larger than the sum of its proper divisors (168711123199).
11202201011201 is a wasteful number, since it uses less digits than its factorization.
11202201011201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151856239.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11202201011201 its reverse (10211010220211), we get a palindrome (21413211231412).
The spelling of 11202201011201 in words is "eleven trillion, two hundred two billion, two hundred one million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •