Base | Representation |
---|---|
bin | 10101011111110100… |
… | …11000000110100001 |
3 | 1002210022220021021221 |
4 | 22233322120012201 |
5 | 142114030003330 |
6 | 5145121015041 |
7 | 556001003353 |
oct | 125772300641 |
9 | 32708807257 |
10 | 11541250465 |
11 | 499280a328 |
12 | 22a1184481 |
13 | 111c0c34b4 |
14 | 7b6b230d3 |
15 | 478354b7a |
hex | 2afe981a1 |
11541250465 has 8 divisors (see below), whose sum is σ = 14578421760. Its totient is φ = 8747052912.
The previous prime is 11541250397. The next prime is 11541250499. The reversal of 11541250465 is 56405214511.
11541250465 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11541250465 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11541250465.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 60743329 + ... + 60743518.
It is an arithmetic number, because the mean of its divisors is an integer number (1822302720).
Almost surely, 211541250465 is an apocalyptic number.
It is an amenable number.
11541250465 is a deficient number, since it is larger than the sum of its proper divisors (3037171295).
11541250465 is a wasteful number, since it uses less digits than its factorization.
11541250465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121486871.
The product of its (nonzero) digits is 24000, while the sum is 34.
Adding to 11541250465 its reverse (56405214511), we get a palindrome (67946464976).
The spelling of 11541250465 in words is "eleven billion, five hundred forty-one million, two hundred fifty thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •