Base | Representation |
---|---|
bin | 10000000001100000011… |
… | …110000110011010011001 |
3 | 10220021012122121101011001 |
4 | 100001200132012122121 |
5 | 121020103303143342 |
6 | 2201504024105001 |
7 | 142361013453253 |
oct | 20014036063231 |
9 | 3807178541131 |
10 | 1101130131097 |
11 | 394a94286237 |
12 | 1594a6305161 |
13 | 7cab3c787b9 |
14 | 3b41b60acd3 |
15 | 1d999cd98b7 |
hex | 10060786699 |
1101130131097 has 2 divisors, whose sum is σ = 1101130131098. Its totient is φ = 1101130131096.
The previous prime is 1101130131089. The next prime is 1101130131137. The reversal of 1101130131097 is 7901310311011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1000648104976 + 100482026121 = 1000324^2 + 316989^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101130131097 - 23 = 1101130131089 is a prime.
It is not a weakly prime, because it can be changed into another prime (1101130135097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550565065548 + 550565065549.
It is an arithmetic number, because the mean of its divisors is an integer number (550565065549).
Almost surely, 21101130131097 is an apocalyptic number.
It is an amenable number.
1101130131097 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101130131097 is an equidigital number, since it uses as much as digits as its factorization.
1101130131097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 28.
The spelling of 1101130131097 in words is "one trillion, one hundred one billion, one hundred thirty million, one hundred thirty-one thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •