Base | Representation |
---|---|
bin | 11110100011110010010… |
… | …111001011010001101101 |
3 | 21102202111022200112000211 |
4 | 132203302113023101231 |
5 | 233401310102432341 |
6 | 4244421550422421 |
7 | 304502132124451 |
oct | 36436227132155 |
9 | 7382438615024 |
10 | 2100010202221 |
11 | 73a678014a78 |
12 | 29abb5201a11 |
13 | 123051206719 |
14 | 738d9008661 |
15 | 3995d080181 |
hex | 1e8f25cb46d |
2100010202221 has 8 divisors (see below), whose sum is σ = 2104305320000. Its totient is φ = 2095715432160.
The previous prime is 2100010202207. The next prime is 2100010202273. The reversal of 2100010202221 is 1222020100012.
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 2100010202221 - 237 = 1962571248749 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 (2100010202201) 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, 14494225 + ... + 14638393.
It is an arithmetic number, because the mean of its divisors is an integer number (263038165000).
Almost surely, 22100010202221 is an apocalyptic number.
It is an amenable number.
2100010202221 is a deficient number, since it is larger than the sum of its proper divisors (4295117779).
2100010202221 is a wasteful number, since it uses less digits than its factorization.
2100010202221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173859.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 2100010202221 its reverse (1222020100012), we get a palindrome (3322030302233).
The spelling of 2100010202221 in words is "two trillion, one hundred billion, ten million, two hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •