Base | Representation |
---|---|
bin | 10000000001011000101… |
… | …101101110110010111001 |
3 | 10220020212120202120211212 |
4 | 100001120231232302321 |
5 | 121014322000322222 |
6 | 2201443055132505 |
7 | 142354543452221 |
oct | 20013055566271 |
9 | 3806776676755 |
10 | 1101000010937 |
11 | 394a27892012 |
12 | 15946a814135 |
13 | 7ca9301a418 |
14 | 3b408219081 |
15 | 1d98d6856e2 |
hex | 10058b6ecb9 |
1101000010937 has 2 divisors, whose sum is σ = 1101000010938. Its totient is φ = 1101000010936.
The previous prime is 1101000010853. The next prime is 1101000011011. The reversal of 1101000010937 is 7390100001011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 977450572921 + 123549438016 = 988661^2 + 351496^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101000010937 - 210 = 1101000009913 is a prime.
It is not a weakly prime, because it can be changed into another prime (1101000510937) 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, 550500005468 + 550500005469.
It is an arithmetic number, because the mean of its divisors is an integer number (550500005469).
Almost surely, 21101000010937 is an apocalyptic number.
It is an amenable number.
1101000010937 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101000010937 is an equidigital number, since it uses as much as digits as its factorization.
1101000010937 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 189, while the sum is 23.
Adding to 1101000010937 its reverse (7390100001011), we get a palindrome (8491100011948).
The spelling of 1101000010937 in words is "one trillion, one hundred one billion, ten thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •