Base | Representation |
---|---|
bin | 10100100110011011… |
… | …00100000100000011 |
3 | 1001112202212001101111 |
4 | 22103031210010003 |
5 | 140122243202211 |
6 | 5025240344151 |
7 | 541033150441 |
oct | 122315440403 |
9 | 31482761344 |
10 | 11059740931 |
11 | 4765a32068 |
12 | 2187a75057 |
13 | 1073413705 |
14 | 76cbc1b91 |
15 | 44ae40421 |
hex | 293364103 |
11059740931 has 2 divisors, whose sum is σ = 11059740932. Its totient is φ = 11059740930.
The previous prime is 11059740907. The next prime is 11059741001. The reversal of 11059740931 is 13904795011.
It is a weak prime.
It is an emirp because it is prime and its reverse (13904795011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11059740931 - 27 = 11059740803 is a prime.
It is a super-2 number, since 2×110597409312 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11059740431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5529870465 + 5529870466.
It is an arithmetic number, because the mean of its divisors is an integer number (5529870466).
Almost surely, 211059740931 is an apocalyptic number.
11059740931 is a deficient number, since it is larger than the sum of its proper divisors (1).
11059740931 is an equidigital number, since it uses as much as digits as its factorization.
11059740931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34020, while the sum is 40.
The spelling of 11059740931 in words is "eleven billion, fifty-nine million, seven hundred forty thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •