Base | Representation |
---|---|
bin | 1011101001110110000… |
… | …0110011111110000001 |
3 | 201010210001112200200201 |
4 | 2322131200303332001 |
5 | 11240013021320001 |
6 | 231550431045201 |
7 | 20315263304134 |
oct | 2723540637601 |
9 | 633701480621 |
10 | 200211120001 |
11 | 779aaa59842 |
12 | 32976370801 |
13 | 15b58c9aa59 |
14 | 999415a21b |
15 | 531bc78501 |
hex | 2e9d833f81 |
200211120001 has 8 divisors (see below), whose sum is σ = 200804147208. Its totient is φ = 199618560000.
The previous prime is 200211119993. The next prime is 200211120013. The reversal of 200211120001 is 100021112002.
It can be written as a sum of positive squares in 4 ways, for example, as 160460330625 + 39750789376 = 400575^2 + 199376^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200211120001 - 23 = 200211119993 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 200211120001.
It is not an unprimeable number, because it can be changed into a prime (200211120071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 751041 + ... + 982081.
It is an arithmetic number, because the mean of its divisors is an integer number (25100518401).
Almost surely, 2200211120001 is an apocalyptic number.
It is an amenable number.
200211120001 is a deficient number, since it is larger than the sum of its proper divisors (593027207).
200211120001 is a wasteful number, since it uses less digits than its factorization.
200211120001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 233603.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 200211120001 its reverse (100021112002), we get a palindrome (300232232003).
The spelling of 200211120001 in words is "two hundred billion, two hundred eleven million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •