Base | Representation |
---|---|
bin | 10111001111001111001101… |
… | …111001011101011001010011 |
3 | 111101212102202010101121202221 |
4 | 113033033031321131121103 |
5 | 101343440102001401321 |
6 | 1001211013145121511 |
7 | 30345602551402540 |
oct | 2717171571353123 |
9 | 441772663347687 |
10 | 102202201200211 |
11 | 2a62378a198492 |
12 | b56757a489297 |
13 | 450481aa5b1c8 |
14 | 1b34881c53bc7 |
15 | bc37a90c8e41 |
hex | 5cf3cde5d653 |
102202201200211 has 8 divisors (see below), whose sum is σ = 116857846093824. Its totient is φ = 87560388915720.
The previous prime is 102202201200173. The next prime is 102202201200223. The reversal of 102202201200211 is 112002102202201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102202201200211 - 223 = 102202192811603 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102202201201211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3458136445 + ... + 3458165998.
It is an arithmetic number, because the mean of its divisors is an integer number (14607230761728).
Almost surely, 2102202201200211 is an apocalyptic number.
102202201200211 is a deficient number, since it is larger than the sum of its proper divisors (14655644893613).
102202201200211 is an equidigital number, since it uses as much as digits as its factorization.
102202201200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6916304561.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 102202201200211 its reverse (112002102202201), we get a palindrome (214204303402412).
The spelling of 102202201200211 in words is "one hundred two trillion, two hundred two billion, two hundred one million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •