Base | Representation |
---|---|
bin | 10100100011001111… |
… | …01101011001001001 |
3 | 1001110220121112020001 |
4 | 22101213231121021 |
5 | 140043424243312 |
6 | 5022444203001 |
7 | 540260203465 |
oct | 122147553111 |
9 | 31426545201 |
10 | 11033040457 |
11 | 475195565a |
12 | 217ab39461 |
13 | 106aa2550a |
14 | 7694314a5 |
15 | 448919057 |
hex | 2919ed649 |
11033040457 has 2 divisors, whose sum is σ = 11033040458. Its totient is φ = 11033040456.
The previous prime is 11033040449. The next prime is 11033040463. The reversal of 11033040457 is 75404033011.
11033040457 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8119631881 + 2913408576 = 90109^2 + 53976^2 .
It is an emirp because it is prime and its reverse (75404033011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11033040457 - 23 = 11033040449 is a prime.
It is not a weakly prime, because it can be changed into another prime (11033040257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5516520228 + 5516520229.
It is an arithmetic number, because the mean of its divisors is an integer number (5516520229).
Almost surely, 211033040457 is an apocalyptic number.
It is an amenable number.
11033040457 is a deficient number, since it is larger than the sum of its proper divisors (1).
11033040457 is an equidigital number, since it uses as much as digits as its factorization.
11033040457 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 28.
Adding to 11033040457 its reverse (75404033011), we get a palindrome (86437073468).
The spelling of 11033040457 in words is "eleven billion, thirty-three million, forty thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •