Base | Representation |
---|---|
bin | 10111001111001101001010… |
… | …101101010110110011101001 |
3 | 111101212020001201211211211111 |
4 | 113033031022231112303221 |
5 | 101343421100023242301 |
6 | 1001210010522230321 |
7 | 30345464164330063 |
oct | 2717151255266351 |
9 | 441766051754744 |
10 | 102200000212201 |
11 | 2a62285a853631 |
12 | b5670653553a1 |
13 | 4504559a71c38 |
14 | 1b347137da733 |
15 | bc36cac64551 |
hex | 5cf34ab56ce9 |
102200000212201 has 4 divisors (see below), whose sum is σ = 102200289698304. Its totient is φ = 102199710726100.
The previous prime is 102200000212181. The next prime is 102200000212217. The reversal of 102200000212201 is 102212000002201.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 102200000212201 - 211 = 102200000210153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102200000212301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 144212845 + ... + 144919786.
It is an arithmetic number, because the mean of its divisors is an integer number (25550072424576).
Almost surely, 2102200000212201 is an apocalyptic number.
It is an amenable number.
102200000212201 is a deficient number, since it is larger than the sum of its proper divisors (289486103).
102200000212201 is an equidigital number, since it uses as much as digits as its factorization.
102200000212201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 289486102.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 102200000212201 its reverse (102212000002201), we get a palindrome (204412000214402).
The spelling of 102200000212201 in words is "one hundred two trillion, two hundred billion, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •