Base | Representation |
---|---|
bin | 111011100110111… |
… | …0100000110110010 |
3 | 12011101120010010020 |
4 | 1313031310012302 |
5 | 13044012010002 |
6 | 530245144310 |
7 | 100364440332 |
oct | 16715640662 |
9 | 5141503106 |
10 | 2000110002 |
11 | 937012280 |
12 | 4799bb096 |
13 | 25b4b5457 |
14 | 14d8c70c2 |
15 | ba8d52bc |
hex | 773741b2 |
2000110002 has 48 divisors (see below), whose sum is σ = 4391225568. Its totient is φ = 602314240.
The previous prime is 2000109967. The next prime is 2000110009.
It is a happy number.
2000110002 is nontrivially palindromic in base 10.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is not an unprimeable number, because it can be changed into a prime (2000110009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5665858 + ... + 5666210.
It is an arithmetic number, because the mean of its divisors is an integer number (91483866).
Almost surely, 22000110002 is an apocalyptic number.
2000110002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2000110002 is an abundant number, since it is smaller than the sum of its proper divisors (2391115566).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000110002 is a wasteful number, since it uses less digits than its factorization.
2000110002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 955 (or 662 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 6.
The square root of 2000110002 is about 44722.5893928337. The cubic root of 2000110002 is about 1259.9441484440.
It can be divided in two parts, 20001 and 10002, that multiplied together give a palindrome (200050002).
The spelling of 2000110002 in words is "two billion, one hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •