Base | Representation |
---|---|
bin | 11101000110101111110… |
… | …110001110100110001010 |
3 | 21002012122002212111102000 |
4 | 131012233312032212022 |
5 | 230232211131133002 |
6 | 4130500551051430 |
7 | 264334406445012 |
oct | 35065766164612 |
9 | 7065562774360 |
10 | 2000110021002 |
11 | 701272a67235 |
12 | 283774970b76 |
13 | 1167c02a6162 |
14 | 6cb3d32cc42 |
15 | 370629b161c |
hex | 1d1afd8e98a |
2000110021002 has 64 divisors (see below), whose sum is σ = 4456159488000. Its totient is φ = 664983983664.
The previous prime is 2000110020989. The next prime is 2000110021037. The reversal of 2000110021002 is 2001200110002.
It is a super-2 number, since 2×20001100210022 (a number of 25 digits) contains 22 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 (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 64464649 + ... + 64495667.
It is an arithmetic number, because the mean of its divisors is an integer number (69627492000).
Almost surely, 22000110021002 is an apocalyptic number.
2000110021002 is an abundant number, since it is smaller than the sum of its proper divisors (2456049466998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000110021002 is a wasteful number, since it uses less digits than its factorization.
2000110021002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34072 (or 34066 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 2000110021002 its reverse (2001200110002), we get a palindrome (4001310131004).
The spelling of 2000110021002 in words is "two trillion, one hundred ten million, twenty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •