Base | Representation |
---|---|
bin | 10111000000111110010110… |
… | …000101001010010100010011 |
3 | 111021101201201001212021021122 |
4 | 113000332112011022110103 |
5 | 101231410140110401321 |
6 | 555140430033112455 |
7 | 30215022552356150 |
oct | 2700762605122423 |
9 | 437351631767248 |
10 | 101222012200211 |
11 | 2a286018042071 |
12 | b4296070b872b |
13 | 446326bc64a96 |
14 | 1add258975227 |
15 | ba803bbe88ab |
hex | 5c0f9614a513 |
101222012200211 has 4 divisors (see below), whose sum is σ = 115682299657392. Its totient is φ = 86761724743032.
The previous prime is 101222012200189. The next prime is 101222012200249. The reversal of 101222012200211 is 112002210222101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101222012200211 - 26 = 101222012200147 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101222012200211.
It is not an unprimeable number, because it can be changed into a prime (101222012200271) 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, 7230143728580 + ... + 7230143728593.
It is an arithmetic number, because the mean of its divisors is an integer number (28920574914348).
Almost surely, 2101222012200211 is an apocalyptic number.
101222012200211 is a deficient number, since it is larger than the sum of its proper divisors (14460287457181).
101222012200211 is an equidigital number, since it uses as much as digits as its factorization.
101222012200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14460287457180.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 101222012200211 its reverse (112002210222101), we get a palindrome (213224222422312).
The spelling of 101222012200211 in words is "one hundred one trillion, two hundred twenty-two billion, twelve million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •