Base | Representation |
---|---|
bin | 1010001011111100000000… |
… | …0011111100011010000001 |
3 | 1110122201200100001000201100 |
4 | 2202333000003330122001 |
5 | 2432001003203000001 |
6 | 35453145103125013 |
7 | 2234121306124530 |
oct | 242770003743201 |
9 | 43581610030640 |
10 | 11200202000001 |
11 | 3628a85049763 |
12 | 130a810ba3769 |
13 | 63323654a951 |
14 | 2aa1423da317 |
15 | 146522730586 |
hex | a2fc00fc681 |
11200202000001 has 48 divisors (see below), whose sum is σ = 19302257145600. Its totient is φ = 6122729741184.
The previous prime is 11200201999967. The next prime is 11200202000069. The reversal of 11200202000001 is 10000020200211.
It is not a de Polignac number, because 11200202000001 - 215 = 11200201967233 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11200202000201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 27921861 + ... + 28320146.
It is an arithmetic number, because the mean of its divisors is an integer number (402130357200).
Almost surely, 211200202000001 is an apocalyptic number.
It is an amenable number.
11200202000001 is a deficient number, since it is larger than the sum of its proper divisors (8102055145599).
11200202000001 is a wasteful number, since it uses less digits than its factorization.
11200202000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56242158 (or 56242155 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 11200202000001 its reverse (10000020200211), we get a palindrome (21200222200212).
The spelling of 11200202000001 in words is "eleven trillion, two hundred billion, two hundred two million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •