Base | Representation |
---|---|
bin | 1010001001000101101001… |
… | …0100011110000110001011 |
3 | 1110111001022210222220111002 |
4 | 2202101122110132012023 |
5 | 2430200230101303021 |
6 | 35414451432525215 |
7 | 2230436244412316 |
oct | 242213224360613 |
9 | 43431283886432 |
10 | 11151250416011 |
11 | 360a245169122 |
12 | 130122b25080b |
13 | 62b734a6a534 |
14 | 2a7a1b01b97d |
15 | 145109e3250b |
hex | a245a51e18b |
11151250416011 has 2 divisors, whose sum is σ = 11151250416012. Its totient is φ = 11151250416010.
The previous prime is 11151250415927. The next prime is 11151250416037. The reversal of 11151250416011 is 11061405215111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11151250416011 - 230 = 11150176674187 is a prime.
It is not a weakly prime, because it can be changed into another prime (11151250416071) 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, 5575625208005 + 5575625208006.
It is an arithmetic number, because the mean of its divisors is an integer number (5575625208006).
Almost surely, 211151250416011 is an apocalyptic number.
11151250416011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11151250416011 is an equidigital number, since it uses as much as digits as its factorization.
11151250416011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 29.
The spelling of 11151250416011 in words is "eleven trillion, one hundred fifty-one billion, two hundred fifty million, four hundred sixteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •