Base | Representation |
---|---|
bin | 10111001111001101001011… |
… | …011011001010011100110011 |
3 | 111101212020002120102220201121 |
4 | 113033031023123022130303 |
5 | 101343421111112021321 |
6 | 1001210012031443111 |
7 | 30345464401361623 |
oct | 2717151333123463 |
9 | 441766076386647 |
10 | 102200012220211 |
11 | 2a622866605404 |
12 | b567069386497 |
13 | 450455c3b7779 |
14 | 1b34715244883 |
15 | bc36cbd37441 |
hex | 5cf34b6ca733 |
102200012220211 has 4 divisors (see below), whose sum is σ = 103211893529424. Its totient is φ = 101188130911000.
The previous prime is 102200012220149. The next prime is 102200012220287. The reversal of 102200012220211 is 112022210002201.
It is a happy number.
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 102200012220211 - 27 = 102200012220083 is a prime.
It is a super-2 number, since 2×1022000122202112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102200012220011) 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, 505940654455 + ... + 505940654656.
It is an arithmetic number, because the mean of its divisors is an integer number (25802973382356).
Almost surely, 2102200012220211 is an apocalyptic number.
102200012220211 is a deficient number, since it is larger than the sum of its proper divisors (1011881309213).
102200012220211 is a wasteful number, since it uses less digits than its factorization.
102200012220211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1011881309212.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 102200012220211 its reverse (112022210002201), we get a palindrome (214222222222412).
The spelling of 102200012220211 in words is "one hundred two trillion, two hundred billion, twelve million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •