Base | Representation |
---|---|
bin | 1011101001110101110… |
… | …0111010111110000101 |
3 | 201010202222121212122122 |
4 | 2322131130322332011 |
5 | 11240012241200401 |
6 | 231550353135325 |
7 | 20315251525514 |
oct | 2723534727605 |
9 | 633688555578 |
10 | 200210100101 |
11 | 779aa422550 |
12 | 32975b5a545 |
13 | 15b58a0176b |
14 | 9993d7267b |
15 | 531bb2621b |
hex | 2e9d73af85 |
200210100101 has 8 divisors (see below), whose sum is σ = 218426928384. Its totient is φ = 181995923520.
The previous prime is 200210100067. The next prime is 200210100113. The reversal of 200210100101 is 101001012002.
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 200210100101 - 218 = 200209837957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200210105101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 503381 + ... + 808586.
It is an arithmetic number, because the mean of its divisors is an integer number (27303366048).
Almost surely, 2200210100101 is an apocalyptic number.
It is an amenable number.
200210100101 is a deficient number, since it is larger than the sum of its proper divisors (18216828283).
200210100101 is a wasteful number, since it uses less digits than its factorization.
200210100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1325851.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 200210100101 its reverse (101001012002), we get a palindrome (301211112103).
It can be divided in two parts, 2002 and 10100101, that multiplied together give a palindrome (20220402202).
The spelling of 200210100101 in words is "two hundred billion, two hundred ten million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •