Base | Representation |
---|---|
bin | 10000000001011000110… |
… | …101010100101100000101 |
3 | 10220020212201111200220201 |
4 | 100001120311110230011 |
5 | 121014323003014112 |
6 | 2201443205530501 |
7 | 142354566411502 |
oct | 20013065245405 |
9 | 3806781450821 |
10 | 1101002001157 |
11 | 394a28a21323 |
12 | 15946b413a31 |
13 | 7ca93566276 |
14 | 3b4085b64a9 |
15 | 1d98d92a257 |
hex | 10058d54b05 |
1101002001157 has 2 divisors, whose sum is σ = 1101002001158. Its totient is φ = 1101002001156.
The previous prime is 1101002001119. The next prime is 1101002001241. The reversal of 1101002001157 is 7511002001011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 977357640996 + 123644360161 = 988614^2 + 351631^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101002001157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101002001257) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550501000578 + 550501000579.
It is an arithmetic number, because the mean of its divisors is an integer number (550501000579).
Almost surely, 21101002001157 is an apocalyptic number.
It is an amenable number.
1101002001157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101002001157 is an equidigital number, since it uses as much as digits as its factorization.
1101002001157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 70, while the sum is 19.
Adding to 1101002001157 its reverse (7511002001011), we get a palindrome (8612004002168).
The spelling of 1101002001157 in words is "one trillion, one hundred one billion, two million, one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •