Base | Representation |
---|---|
bin | 1010001100000011000101… |
… | …0000110100100001110011 |
3 | 1110122220120200201102201111 |
4 | 2203000301100310201303 |
5 | 2432013400401413021 |
6 | 35454101345414151 |
7 | 2234216340065650 |
oct | 243006120644163 |
9 | 43586520642644 |
10 | 11202101201011 |
11 | 362986a0a9576 |
12 | 130b06103a357 |
13 | 633479b61926 |
14 | 2aa282736c27 |
15 | 1465d43318e1 |
hex | a3031434873 |
11202101201011 has 16 divisors (see below), whose sum is σ = 13361065848000. Its totient is φ = 9188662791168.
The previous prime is 11202101200999. The next prime is 11202101201047. The reversal of 11202101201011 is 11010210120211.
It is a happy number.
It is not a de Polignac number, because 11202101201011 - 213 = 11202101192819 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11202101200982 and 11202101201000.
It is not an unprimeable number, because it can be changed into a prime (11202101201411) 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 15 ways as a sum of consecutive naturals, for example, 244148586 + ... + 244194463.
It is an arithmetic number, because the mean of its divisors is an integer number (835066615500).
Almost surely, 211202101201011 is an apocalyptic number.
11202101201011 is a deficient number, since it is larger than the sum of its proper divisors (2158964646989).
11202101201011 is a wasteful number, since it uses less digits than its factorization.
11202101201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488343198.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11202101201011 its reverse (11010210120211), we get a palindrome (22212311321222).
The spelling of 11202101201011 in words is "eleven trillion, two hundred two billion, one hundred one million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •