Base | Representation |
---|---|
bin | 1010001100000010101100… |
… | …1111111111011001101000 |
3 | 1110122220022122220011010121 |
4 | 2203000223033333121220 |
5 | 2432013144040220404 |
6 | 35454043343253024 |
7 | 2234214003444346 |
oct | 243005317773150 |
9 | 43586278804117 |
10 | 11202000320104 |
11 | 3629818166220 |
12 | 130b0332aa174 |
13 | 633461ca0199 |
14 | 2aa273196996 |
15 | 1465ca555e54 |
hex | a302b3ff668 |
11202000320104 has 64 divisors (see below), whose sum is σ = 24390141336000. Its totient is φ = 4769627512320.
The previous prime is 11202000320051. The next prime is 11202000320107. The reversal of 11202000320104 is 40102300020211.
It is a super-2 number, since 2×112020003201042 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11202000320107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 37490299 + ... + 37787914.
It is an arithmetic number, because the mean of its divisors is an integer number (381095958375).
Almost surely, 211202000320104 is an apocalyptic number.
It is an amenable number.
11202000320104 is an abundant number, since it is smaller than the sum of its proper divisors (13188141015896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11202000320104 is a wasteful number, since it uses less digits than its factorization.
11202000320104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75278338 (or 75278334 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 11202000320104 its reverse (40102300020211), we get a palindrome (51304300340315).
The spelling of 11202000320104 in words is "eleven trillion, two hundred two billion, three hundred twenty thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •