Base | Representation |
---|---|
bin | 10000000001100101111… |
… | …001100010111110011101 |
3 | 10220021102222222202202002 |
4 | 100001211321202332131 |
5 | 121020300112241221 |
6 | 2201521040212045 |
7 | 142363200600365 |
oct | 20014571427635 |
9 | 3807388882662 |
10 | 1101221212061 |
11 | 395030735763 |
12 | 15951090a025 |
13 | 7cac9ab8769 |
14 | 3b4297599a5 |
15 | 1d9a2ccb80b |
hex | 10065e62f9d |
1101221212061 has 2 divisors, whose sum is σ = 1101221212062. Its totient is φ = 1101221212060.
The previous prime is 1101221212033. The next prime is 1101221212081. The reversal of 1101221212061 is 1602121221011.
It is an a-pointer prime, because the next prime (1101221212081) can be obtained adding 1101221212061 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1092171304900 + 9049907161 = 1045070^2 + 95131^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101221212061 - 226 = 1101154103197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101221212081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550610606030 + 550610606031.
It is an arithmetic number, because the mean of its divisors is an integer number (550610606031).
Almost surely, 21101221212061 is an apocalyptic number.
It is an amenable number.
1101221212061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101221212061 is an equidigital number, since it uses as much as digits as its factorization.
1101221212061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 1101221212061 its reverse (1602121221011), we get a palindrome (2703342433072).
The spelling of 1101221212061 in words is "one trillion, one hundred one billion, two hundred twenty-one million, two hundred twelve thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •