Base | Representation |
---|---|
bin | 1010010011001110110100… |
… | …1111010010100010100111 |
3 | 1111002201010112200020001220 |
4 | 2210303231033102202213 |
5 | 2441024123041004201 |
6 | 40030511434151423 |
7 | 2246145536425152 |
oct | 244635517224247 |
9 | 44081115606056 |
10 | 11325514000551 |
11 | 367713a441483 |
12 | 132ab63882573 |
13 | 641cb71039ba |
14 | 2b222d01cc99 |
15 | 149908c1c036 |
hex | a4ced3d28a7 |
11325514000551 has 8 divisors (see below), whose sum is σ = 15104625001200. Its totient is φ = 7548372833472.
The previous prime is 11325514000543. The next prime is 11325514000553. The reversal of 11325514000551 is 15500041552311.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11325514000551 - 23 = 11325514000543 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11325514000553) 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 in 7 ways as a sum of consecutive naturals, for example, 492444976 + ... + 492467973.
It is an arithmetic number, because the mean of its divisors is an integer number (1888078125150).
Almost surely, 211325514000551 is an apocalyptic number.
11325514000551 is a deficient number, since it is larger than the sum of its proper divisors (3779111000649).
11325514000551 is an equidigital number, since it uses as much as digits as its factorization.
11325514000551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 984916785.
The product of its (nonzero) digits is 15000, while the sum is 33.
Adding to 11325514000551 its reverse (15500041552311), we get a palindrome (26825555552862).
The spelling of 11325514000551 in words is "eleven trillion, three hundred twenty-five billion, five hundred fourteen million, five hundred fifty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •