Base | Representation |
---|---|
bin | 10111001111011111111001… |
… | …011110000111111010001001 |
3 | 111101221010222100220122122212 |
4 | 113033133321132013322021 |
5 | 101344233242144213001 |
6 | 1001223134325554505 |
7 | 30350105445503306 |
oct | 2717377136077211 |
9 | 441833870818585 |
10 | 102220112101001 |
11 | 2a630340454334 |
12 | b56ab38875a35 |
13 | 450641369385b |
14 | 1b356a08ca0ad |
15 | bc3ea67327bb |
hex | 5cf7f9787e89 |
102220112101001 has 2 divisors, whose sum is σ = 102220112101002. Its totient is φ = 102220112101000.
The previous prime is 102220112100991. The next prime is 102220112101043. The reversal of 102220112101001 is 100101211022201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96940250238976 + 5279861862025 = 9845824^2 + 2297795^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102220112101001 is a prime.
It is a super-2 number, since 2×1022201121010012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102220112101901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51110056050500 + 51110056050501.
It is an arithmetic number, because the mean of its divisors is an integer number (51110056050501).
Almost surely, 2102220112101001 is an apocalyptic number.
It is an amenable number.
102220112101001 is a deficient number, since it is larger than the sum of its proper divisors (1).
102220112101001 is an equidigital number, since it uses as much as digits as its factorization.
102220112101001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 102220112101001 its reverse (100101211022201), we get a palindrome (202321323123202).
The spelling of 102220112101001 in words is "one hundred two trillion, two hundred twenty billion, one hundred twelve million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •