Base | Representation |
---|---|
bin | 10100100000101000… |
… | …00011101000011011 |
3 | 1001102101100102021122 |
4 | 22100110003220123 |
5 | 140022321031301 |
6 | 5020342155455 |
7 | 536602621514 |
oct | 122024035033 |
9 | 31371312248 |
10 | 11011111451 |
11 | 474053800a |
12 | 2173722b8b |
13 | 1066318082 |
14 | 766563a0b |
15 | 446a3681b |
hex | 290503a1b |
11011111451 has 2 divisors, whose sum is σ = 11011111452. Its totient is φ = 11011111450.
The previous prime is 11011111387. The next prime is 11011111469. The reversal of 11011111451 is 15411111011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11011111451 - 26 = 11011111387 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (11011111051) 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, 5505555725 + 5505555726.
It is an arithmetic number, because the mean of its divisors is an integer number (5505555726).
Almost surely, 211011111451 is an apocalyptic number.
11011111451 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011111451 is an equidigital number, since it uses as much as digits as its factorization.
11011111451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20, while the sum is 17.
Adding to 11011111451 its reverse (15411111011), we get a palindrome (26422222462).
The spelling of 11011111451 in words is "eleven billion, eleven million, one hundred eleven thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •