Base | Representation |
---|---|
bin | 10001100111111011011… |
… | …100110000101111100101 |
3 | 11021210001221122122201112 |
4 | 101213323130300233211 |
5 | 124320320213243302 |
6 | 2324212415034405 |
7 | 153333203544452 |
oct | 21477334605745 |
9 | 4253057578645 |
10 | 1211104431077 |
11 | 427698972562 |
12 | 17687850ba05 |
13 | 8a28c047998 |
14 | 42891220829 |
15 | 21784a07552 |
hex | 119fb730be5 |
1211104431077 has 2 divisors, whose sum is σ = 1211104431078. Its totient is φ = 1211104431076.
The previous prime is 1211104431037. The next prime is 1211104431109. The reversal of 1211104431077 is 7701344011121.
It is an a-pointer prime, because the next prime (1211104431109) can be obtained adding 1211104431077 to its sum of digits (32).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1077639152836 + 133465278241 = 1038094^2 + 365329^2 .
It is a cyclic number.
It is not a de Polignac number, because 1211104431077 - 214 = 1211104414693 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1211104431007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605552215538 + 605552215539.
It is an arithmetic number, because the mean of its divisors is an integer number (605552215539).
Almost surely, 21211104431077 is an apocalyptic number.
It is an amenable number.
1211104431077 is a deficient number, since it is larger than the sum of its proper divisors (1).
1211104431077 is an equidigital number, since it uses as much as digits as its factorization.
1211104431077 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4704, while the sum is 32.
Adding to 1211104431077 its reverse (7701344011121), we get a palindrome (8912448442198).
The spelling of 1211104431077 in words is "one trillion, two hundred eleven billion, one hundred four million, four hundred thirty-one thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •