Base | Representation |
---|---|
bin | 10000000001011001010… |
… | …111101100010110110101 |
3 | 10220020220100110110002111 |
4 | 100001121113230112311 |
5 | 121014332304322442 |
6 | 2201444131011021 |
7 | 142355036115322 |
oct | 20013127542665 |
9 | 3806810413074 |
10 | 1101011010997 |
11 | 394a33015577 |
12 | 159472439a71 |
13 | 7ca9539c231 |
14 | 3b40987db49 |
15 | 1d98e609b17 |
hex | 100595ec5b5 |
1101011010997 has 2 divisors, whose sum is σ = 1101011010998. Its totient is φ = 1101011010996.
The previous prime is 1101011010991. The next prime is 1101011011021. The reversal of 1101011010997 is 7990101101011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1067421651921 + 33589359076 = 1033161^2 + 183274^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101011010997 - 223 = 1101002622389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101011010991) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550505505498 + 550505505499.
It is an arithmetic number, because the mean of its divisors is an integer number (550505505499).
Almost surely, 21101011010997 is an apocalyptic number.
It is an amenable number.
1101011010997 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101011010997 is an equidigital number, since it uses as much as digits as its factorization.
1101011010997 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 31.
The spelling of 1101011010997 in words is "one trillion, one hundred one billion, eleven million, ten thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •