Base | Representation |
---|---|
bin | 10100100000111110… |
… | …00111110111101001 |
3 | 1001102120210210121221 |
4 | 22100133013313221 |
5 | 140024041344033 |
6 | 5020524302041 |
7 | 536636363206 |
oct | 122037076751 |
9 | 31376723557 |
10 | 11014012393 |
11 | 474213958a |
12 | 21746a1921 |
13 | 1066ac25c7 |
14 | 766abacad |
15 | 446e0b12d |
hex | 2907c7de9 |
11014012393 has 2 divisors, whose sum is σ = 11014012394. Its totient is φ = 11014012392.
The previous prime is 11014012379. The next prime is 11014012417. The reversal of 11014012393 is 39321041011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8916647184 + 2097365209 = 94428^2 + 45797^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11014012393 is a prime.
It is not a weakly prime, because it can be changed into another prime (11014012363) 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, 5507006196 + 5507006197.
It is an arithmetic number, because the mean of its divisors is an integer number (5507006197).
Almost surely, 211014012393 is an apocalyptic number.
It is an amenable number.
11014012393 is a deficient number, since it is larger than the sum of its proper divisors (1).
11014012393 is an equidigital number, since it uses as much as digits as its factorization.
11014012393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 25.
The spelling of 11014012393 in words is "eleven billion, fourteen million, twelve thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •