Base | Representation |
---|---|
bin | 10000000001011000101… |
… | …101101110100011010001 |
3 | 10220020212120202112110211 |
4 | 100001120231232203101 |
5 | 121014322000304222 |
6 | 2201443055124121 |
7 | 142354543446262 |
oct | 20013055564321 |
9 | 3806776675424 |
10 | 1101000009937 |
11 | 394a27891293 |
12 | 15946a813641 |
13 | 7ca93019b29 |
14 | 3b408218969 |
15 | 1d98d685277 |
hex | 10058b6e8d1 |
1101000009937 has 2 divisors, whose sum is σ = 1101000009938. Its totient is φ = 1101000009936.
The previous prime is 1101000009913. The next prime is 1101000009971. The reversal of 1101000009937 is 7399000001011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 817498072336 + 283501937601 = 904156^2 + 532449^2 .
It is an emirp because it is prime and its reverse (7399000001011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1101000009937 - 215 = 1100999977169 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1101000009899 and 1101000009908.
It is not a weakly prime, because it can be changed into another prime (1101000007937) 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, 550500004968 + 550500004969.
It is an arithmetic number, because the mean of its divisors is an integer number (550500004969).
Almost surely, 21101000009937 is an apocalyptic number.
It is an amenable number.
1101000009937 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101000009937 is an equidigital number, since it uses as much as digits as its factorization.
1101000009937 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1701, while the sum is 31.
The spelling of 1101000009937 in words is "one trillion, one hundred one billion, nine thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •