Base | Representation |
---|---|
bin | 10100011111011011… |
… | …00100001100001101 |
3 | 1001101200100210001112 |
4 | 22033231210030031 |
5 | 140012230134242 |
6 | 5015342021405 |
7 | 536421065045 |
oct | 121755441415 |
9 | 31350323045 |
10 | 11001021197 |
11 | 4735876061 |
12 | 2170277865 |
13 | 10641c43ca |
14 | 765098725 |
15 | 445be1c82 |
hex | 28fb6430d |
11001021197 has 2 divisors, whose sum is σ = 11001021198. Its totient is φ = 11001021196.
The previous prime is 11001021179. The next prime is 11001021217. The reversal of 11001021197 is 79112010011.
It is a happy number.
11001021197 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (11001021179) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10762195081 + 238826116 = 103741^2 + 15454^2 .
It is a cyclic number.
It is not a de Polignac number, because 11001021197 - 232 = 6706053901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11001021107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500510598 + 5500510599.
It is an arithmetic number, because the mean of its divisors is an integer number (5500510599).
Almost surely, 211001021197 is an apocalyptic number.
It is an amenable number.
11001021197 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001021197 is an equidigital number, since it uses as much as digits as its factorization.
11001021197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 126, while the sum is 23.
The spelling of 11001021197 in words is "eleven billion, one million, twenty-one thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •