Base | Representation |
---|---|
bin | 10111000000111101100110… |
… | …111011010110111000001101 |
3 | 111021101122122221021021021102 |
4 | 113000331212323112320031 |
5 | 101231402030100213234 |
6 | 555140215333112445 |
7 | 30214664135213516 |
oct | 2700754673267015 |
9 | 437348587237242 |
10 | 101221221101069 |
11 | 2a285751530623 |
12 | b429426188725 |
13 | 44631740aa394 |
14 | 1add1c1885a0d |
15 | ba7ee252dc7e |
hex | 5c0f66ed6e0d |
101221221101069 has 2 divisors, whose sum is σ = 101221221101070. Its totient is φ = 101221221101068.
The previous prime is 101221221100991. The next prime is 101221221101093. The reversal of 101221221101069 is 960101122122101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100529599338025 + 691621763044 = 10026445^2 + 831638^2 .
It is a cyclic number.
It is not a de Polignac number, because 101221221101069 - 212 = 101221221096973 is a prime.
It is a super-2 number, since 2×1012212211010692 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101221221151069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50610610550534 + 50610610550535.
It is an arithmetic number, because the mean of its divisors is an integer number (50610610550535).
Almost surely, 2101221221101069 is an apocalyptic number.
It is an amenable number.
101221221101069 is a deficient number, since it is larger than the sum of its proper divisors (1).
101221221101069 is an equidigital number, since it uses as much as digits as its factorization.
101221221101069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 29.
The spelling of 101221221101069 in words is "one hundred one trillion, two hundred twenty-one billion, two hundred twenty-one million, one hundred one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •