Base | Representation |
---|---|
bin | 1000001100100001… |
… | …1000010011100010 |
3 | 12200022201012010000 |
4 | 2003020120103202 |
5 | 14001200341002 |
6 | 1002145520430 |
7 | 105342536106 |
oct | 20310302342 |
9 | 5608635100 |
10 | 2200012002 |
11 | a29938641 |
12 | 514943116 |
13 | 290a36c66 |
14 | 16c281906 |
15 | cd22061c |
hex | 832184e2 |
2200012002 has 80 divisors (see below), whose sum is σ = 5057281152. Its totient is φ = 714497760.
The previous prime is 2200011977. The next prime is 2200012037. The reversal of 2200012002 is 2002100022.
It is a super-4 number, since 4×22000120024 (a number of 38 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2154252 + ... + 2155272.
Almost surely, 22200012002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2200012002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2528640576).
2200012002 is an abundant number, since it is smaller than the sum of its proper divisors (2857269150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2200012002 is a wasteful number, since it uses less digits than its factorization.
2200012002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1365 (or 1356 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 9.
The square root of 2200012002 is about 46904.2855398097. The cubic root of 2200012002 is about 1300.5938119529.
Adding to 2200012002 its reverse (2002100022), we get a palindrome (4202112024).
The spelling of 2200012002 in words is "two billion, two hundred million, twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •