Base | Representation |
---|---|
bin | 10100100011001111… |
… | …00011011100111101 |
3 | 1001110220112110101001 |
4 | 22101213203130331 |
5 | 140043421442431 |
6 | 5022443250301 |
7 | 540256644001 |
oct | 122147433475 |
9 | 31426473331 |
10 | 11032999741 |
11 | 4751928005 |
12 | 217ab19991 |
13 | 106aa0cb1a |
14 | 769420701 |
15 | 44890be61 |
hex | 2919e373d |
11032999741 has 2 divisors, whose sum is σ = 11032999742. Its totient is φ = 11032999740.
The previous prime is 11032999739. The next prime is 11032999753. The reversal of 11032999741 is 14799923011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10031024025 + 1001975716 = 100155^2 + 31654^2 .
It is an emirp because it is prime and its reverse (14799923011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11032999741 - 21 = 11032999739 is a prime.
Together with 11032999739, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 11032999691 and 11032999700.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11032994741) 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, 5516499870 + 5516499871.
It is an arithmetic number, because the mean of its divisors is an integer number (5516499871).
Almost surely, 211032999741 is an apocalyptic number.
It is an amenable number.
11032999741 is a deficient number, since it is larger than the sum of its proper divisors (1).
11032999741 is an equidigital number, since it uses as much as digits as its factorization.
11032999741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 122472, while the sum is 46.
The spelling of 11032999741 in words is "eleven billion, thirty-two million, nine hundred ninety-nine thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •