Base | Representation |
---|---|
bin | 10111001101110001000100… |
… | …011001111100001010001001 |
3 | 111101111202210220212021222011 |
4 | 113031301010121330022021 |
5 | 101340311033203224314 |
6 | 1001052334050255521 |
7 | 30335363456231224 |
oct | 2715610431741211 |
9 | 441452726767864 |
10 | 102101110211209 |
11 | 2a594923a4218a |
12 | b54ba672875a1 |
13 | 44c812a204455 |
14 | 1b2da11d5c5bb |
15 | bc0d3e1d84c4 |
hex | 5cdc4467c289 |
102101110211209 has 16 divisors (see below), whose sum is σ = 104576411681280. Its totient is φ = 99638472017920.
The previous prime is 102101110211203. The next prime is 102101110211237. The reversal of 102101110211209 is 902112011101201.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102101110211209 is a prime.
It is a super-2 number, since 2×1021011102112092 (a number of 29 digits) contains 22 as substring.
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 102101110211209.
It is not an unprimeable number, because it can be changed into a prime (102101110211203) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 237384852 + ... + 237814570.
It is an arithmetic number, because the mean of its divisors is an integer number (6536025730080).
Almost surely, 2102101110211209 is an apocalyptic number.
It is an amenable number.
102101110211209 is a deficient number, since it is larger than the sum of its proper divisors (2475301470071).
102101110211209 is a wasteful number, since it uses less digits than its factorization.
102101110211209 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 444440.
The product of its (nonzero) digits is 72, while the sum is 22.
The spelling of 102101110211209 in words is "one hundred two trillion, one hundred one billion, one hundred ten million, two hundred eleven thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •