Base | Representation |
---|---|
bin | 10100101011010101… |
… | …11111010110100001 |
3 | 1001122122111200222002 |
4 | 22111222333112201 |
5 | 140213324244223 |
6 | 5033313053345 |
7 | 542044010432 |
oct | 122552772641 |
9 | 31578450862 |
10 | 11101009313 |
11 | 4787259669 |
12 | 2199857255 |
13 | 107bb32684 |
14 | 774485489 |
15 | 44e892e28 |
hex | 295abf5a1 |
11101009313 has 2 divisors, whose sum is σ = 11101009314. Its totient is φ = 11101009312.
The previous prime is 11101009277. The next prime is 11101009321. The reversal of 11101009313 is 31390010111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10082569744 + 1018439569 = 100412^2 + 31913^2 .
It is a cyclic number.
It is not a de Polignac number, because 11101009313 - 212 = 11101005217 is a prime.
It is not a weakly prime, because it can be changed into another prime (11101009013) 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, 5550504656 + 5550504657.
It is an arithmetic number, because the mean of its divisors is an integer number (5550504657).
Almost surely, 211101009313 is an apocalyptic number.
It is an amenable number.
11101009313 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101009313 is an equidigital number, since it uses as much as digits as its factorization.
11101009313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 20.
Adding to 11101009313 its reverse (31390010111), we get a palindrome (42491019424).
The spelling of 11101009313 in words is "eleven billion, one hundred one million, nine thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •