Base | Representation |
---|---|
bin | 10100100011110000… |
… | …00000001111100001 |
3 | 1001111012122112122012 |
4 | 22101320000033201 |
5 | 140101022440334 |
6 | 5023115522305 |
7 | 540341414045 |
oct | 122170001741 |
9 | 31435575565 |
10 | 11037311969 |
11 | 4754302932 |
12 | 2180459395 |
13 | 106b88c838 |
14 | 769c24025 |
15 | 448eae9ce |
hex | 291e003e1 |
11037311969 has 2 divisors, whose sum is σ = 11037311970. Its totient is φ = 11037311968.
The previous prime is 11037311959. The next prime is 11037312049. The reversal of 11037311969 is 96911373011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9660530944 + 1376781025 = 98288^2 + 37105^2 .
It is a cyclic number.
It is not a de Polignac number, because 11037311969 - 28 = 11037311713 is a prime.
It is a super-2 number, since 2×110373119692 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11037311959) 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, 5518655984 + 5518655985.
It is an arithmetic number, because the mean of its divisors is an integer number (5518655985).
Almost surely, 211037311969 is an apocalyptic number.
It is an amenable number.
11037311969 is a deficient number, since it is larger than the sum of its proper divisors (1).
11037311969 is an equidigital number, since it uses as much as digits as its factorization.
11037311969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30618, while the sum is 41.
The spelling of 11037311969 in words is "eleven billion, thirty-seven million, three hundred eleven thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •