Base | Representation |
---|---|
bin | 1010001100100000111101… |
… | …0010010011101010100001 |
3 | 1110200200021121120111211001 |
4 | 2203020033102103222201 |
5 | 2432131312000144222 |
6 | 35501505235552001 |
7 | 2234622152104324 |
oct | 243101722235241 |
9 | 43620247514731 |
10 | 11210121099937 |
11 | 3632205128311 |
12 | 131071aa5b601 |
13 | 634157551156 |
14 | 2aa8039007bb |
15 | 14690345ce27 |
hex | a320f493aa1 |
11210121099937 has 2 divisors, whose sum is σ = 11210121099938. Its totient is φ = 11210121099936.
The previous prime is 11210121099847. The next prime is 11210121099973. The reversal of 11210121099937 is 73999012101211.
Together with next prime (11210121099973) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5676001294096 + 5534119805841 = 2382436^2 + 2352471^2 .
It is a cyclic number.
It is not a de Polignac number, because 11210121099937 - 27 = 11210121099809 is a prime.
It is not a weakly prime, because it can be changed into another prime (11210121099137) 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, 5605060549968 + 5605060549969.
It is an arithmetic number, because the mean of its divisors is an integer number (5605060549969).
Almost surely, 211210121099937 is an apocalyptic number.
It is an amenable number.
11210121099937 is a deficient number, since it is larger than the sum of its proper divisors (1).
11210121099937 is an equidigital number, since it uses as much as digits as its factorization.
11210121099937 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 61236, while the sum is 46.
The spelling of 11210121099937 in words is "eleven trillion, two hundred ten billion, one hundred twenty-one million, ninety-nine thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •