Base | Representation |
---|---|
bin | 1010000001101111111001… |
… | …0101000110010110101011 |
3 | 1110000222211212111202120122 |
4 | 2200123332111012112223 |
5 | 2421114003133303301 |
6 | 35240515124113455 |
7 | 2215353366315125 |
oct | 240337625062653 |
9 | 43028755452518 |
10 | 11025153025451 |
11 | 3570817504254 |
12 | 12a08b953588b |
13 | 61c88a578576 |
14 | 2a1897d94215 |
15 | 141bc9a0781b |
hex | a06fe5465ab |
11025153025451 has 2 divisors, whose sum is σ = 11025153025452. Its totient is φ = 11025153025450.
The previous prime is 11025153025363. The next prime is 11025153025501. The reversal of 11025153025451 is 15452035152011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11025153025451 is a prime.
It is a super-2 number, since 2×110251530254512 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11025153025151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5512576512725 + 5512576512726.
It is an arithmetic number, because the mean of its divisors is an integer number (5512576512726).
Almost surely, 211025153025451 is an apocalyptic number.
11025153025451 is a deficient number, since it is larger than the sum of its proper divisors (1).
11025153025451 is an equidigital number, since it uses as much as digits as its factorization.
11025153025451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30000, while the sum is 35.
Adding to 11025153025451 its reverse (15452035152011), we get a palindrome (26477188177462).
The spelling of 11025153025451 in words is "eleven trillion, twenty-five billion, one hundred fifty-three million, twenty-five thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •