Base | Representation |
---|---|
bin | 1011101001110110010… |
… | …0101000100110010001 |
3 | 201010210010102121011211 |
4 | 2322131210220212101 |
5 | 11240013300401001 |
6 | 231550504340121 |
7 | 20315304646333 |
oct | 2723544504621 |
9 | 633703377154 |
10 | 200212122001 |
11 | 77a00583641 |
12 | 32976774641 |
13 | 15b5925bb58 |
14 | 999433b453 |
15 | 531bdc5351 |
hex | 2e9d928991 |
200212122001 has 8 divisors (see below), whose sum is σ = 205726391424. Its totient is φ = 194750120880.
The previous prime is 200212121981. The next prime is 200212122017. The reversal of 200212122001 is 100221212002.
It is a happy number.
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 200212122001 - 235 = 165852383633 is a prime.
It is a super-2 number, since 2×2002121220012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200212122301) 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, 13059310 + ... + 13074631.
It is an arithmetic number, because the mean of its divisors is an integer number (25715798928).
Almost surely, 2200212122001 is an apocalyptic number.
It is an amenable number.
200212122001 is a deficient number, since it is larger than the sum of its proper divisors (5514269423).
200212122001 is a wasteful number, since it uses less digits than its factorization.
200212122001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26134151.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 200212122001 its reverse (100221212002), we get a palindrome (300433334003).
Subtracting from 200212122001 its reverse (100221212002), we obtain a palindrome (99990909999).
The spelling of 200212122001 in words is "two hundred billion, two hundred twelve million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •