Base | Representation |
---|---|
bin | 1011101001110101110… |
… | …0100101011101100010 |
3 | 201010202222110101210201 |
4 | 2322131130211131202 |
5 | 11240012230341002 |
6 | 231550351215414 |
7 | 20315251010620 |
oct | 2723534453542 |
9 | 633688411721 |
10 | 200210012002 |
11 | 779aa372340 |
12 | 32975b1756a |
13 | 15b589a0630 |
14 | 9993d4c510 |
15 | 531bb0a087 |
hex | 2e9d725762 |
200210012002 has 32 divisors (see below), whose sum is σ = 403220168064. Its totient is φ = 72003600000.
The previous prime is 200210011997. The next prime is 200210012017.
200210012002 is nontrivially palindromic in base 10.
200210012002 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 200210012002.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50000499 + ... + 50004502.
It is an arithmetic number, because the mean of its divisors is an integer number (12600630252).
Almost surely, 2200210012002 is an apocalyptic number.
200210012002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
200210012002 is an abundant number, since it is smaller than the sum of its proper divisors (203010156062).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200210012002 is a wasteful number, since it uses less digits than its factorization.
200210012002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100005034.
The product of its (nonzero) digits is 16, while the sum is 10.
It can be divided in two parts, 2002100 and 12002, that added together give a palindrome (2014102).
The spelling of 200210012002 in words is "two hundred billion, two hundred ten million, twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •