Base | Representation |
---|---|
bin | 1010001100000011100001… |
… | …0110000000011110110001 |
3 | 1110122220212222021002221112 |
4 | 2203000320112000132301 |
5 | 2432014121310014301 |
6 | 35454121232003105 |
7 | 2234222311632125 |
oct | 243007026003661 |
9 | 43586788232845 |
10 | 11202220001201 |
11 | 3629920170949 |
12 | 130b094990495 |
13 | 6334986586b8 |
14 | 2aa29441d585 |
15 | 1465de99b9bb |
hex | a30385807b1 |
11202220001201 has 8 divisors (see below), whose sum is σ = 11791841507520. Its totient is φ = 10612601592912.
The previous prime is 11202220001117. The next prime is 11202220001209. The reversal of 11202220001201 is 10210002220211.
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 11202220001201 - 242 = 6804173490097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11202220001209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12353351 + ... + 13229123.
It is an arithmetic number, because the mean of its divisors is an integer number (1473980188440).
Almost surely, 211202220001201 is an apocalyptic number.
It is an amenable number.
11202220001201 is a deficient number, since it is larger than the sum of its proper divisors (589621506319).
11202220001201 is an equidigital number, since it uses as much as digits as its factorization.
11202220001201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1549015.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11202220001201 its reverse (10210002220211), we get a palindrome (21412222221412).
The spelling of 11202220001201 in words is "eleven trillion, two hundred two billion, two hundred twenty million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •