Base | Representation |
---|---|
bin | 1011101001110110000… |
… | …0110010000001000010 |
3 | 201010210001112021201110 |
4 | 2322131200302001002 |
5 | 11240013021041002 |
6 | 231550430544150 |
7 | 20315263241616 |
oct | 2723540620102 |
9 | 633701467643 |
10 | 200211112002 |
11 | 779aaa53830 |
12 | 32976368056 |
13 | 15b58c97215 |
14 | 9994157346 |
15 | 531bc75e6c |
hex | 2e9d832042 |
200211112002 has 64 divisors (see below), whose sum is σ = 445262469120. Its totient is φ = 59502849600.
The previous prime is 200211112001. The next prime is 200211112033.
200211112002 is nontrivially palindromic in base 10.
It is not an unprimeable number, because it can be changed into a prime (200211112001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1618668 + ... + 1737960.
It is an arithmetic number, because the mean of its divisors is an integer number (6957226080).
Almost surely, 2200211112002 is an apocalyptic number.
200211112002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 200211112002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (222631234560).
200211112002 is an abundant number, since it is smaller than the sum of its proper divisors (245051357118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200211112002 is a wasteful number, since it uses less digits than its factorization.
200211112002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119799.
The product of its (nonzero) digits is 16, while the sum is 12.
It can be divided in two parts, 200211 and 112002, that added together give a palindrome (312213).
The spelling of 200211112002 in words is "two hundred billion, two hundred eleven million, one hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •