Base | Representation |
---|---|
bin | 1000001100100001… |
… | …1000000100000100 |
3 | 12200022201010202100 |
4 | 2003020120010010 |
5 | 14001200323022 |
6 | 1002145512100 |
7 | 105342533163 |
oct | 20310300404 |
9 | 5608633670 |
10 | 2200011012 |
11 | a29937921 |
12 | 514942630 |
13 | 290a36684 |
14 | 16c2813da |
15 | cd2201ac |
hex | 83218104 |
2200011012 has 36 divisors (see below), whose sum is σ = 5610362940. Its totient is φ = 726845952.
The previous prime is 2200010993. The next prime is 2200011067. The reversal of 2200011012 is 2101100022.
It can be written as a sum of positive squares in 2 ways, for example, as 734193216 + 1465817796 = 27096^2 + 38286^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 2200010985 and 2200011003.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 266337 + ... + 274472.
It is an arithmetic number, because the mean of its divisors is an integer number (155843415).
Almost surely, 22200011012 is an apocalyptic number.
It is an amenable number.
2200011012 is an abundant number, since it is smaller than the sum of its proper divisors (3410351928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2200011012 is a wasteful number, since it uses less digits than its factorization.
2200011012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 540932 (or 540927 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 2200011012 is about 46904.2749864018. The cubic root of 2200011012 is about 1300.5936168649.
Adding to 2200011012 its reverse (2101100022), we get a palindrome (4301111034).
The spelling of 2200011012 in words is "two billion, two hundred million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •