Base | Representation |
---|---|
bin | 10100100100001000… |
… | …00001110111000101 |
3 | 1001111102120200212010 |
4 | 22102010001313011 |
5 | 140102324324300 |
6 | 5023311244433 |
7 | 540410253432 |
oct | 122204016705 |
9 | 31442520763 |
10 | 11040464325 |
11 | 4756066290 |
12 | 2181519719 |
13 | 106c424637 |
14 | 76a404b89 |
15 | 4493d3a50 |
hex | 292101dc5 |
11040464325 has 48 divisors (see below), whose sum is σ = 19941241536. Its totient is φ = 5345356800.
The previous prime is 11040464293. The next prime is 11040464333. The reversal of 11040464325 is 52346404011.
It is not a de Polignac number, because 11040464325 - 25 = 11040464293 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11040464292 and 11040464301.
It is a congruent number.
It is an unprimeable number.
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 in 47 ways as a sum of consecutive naturals, for example, 595597 + ... + 613853.
It is an arithmetic number, because the mean of its divisors is an integer number (415442532).
Almost surely, 211040464325 is an apocalyptic number.
11040464325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11040464325 is a deficient number, since it is larger than the sum of its proper divisors (8900777211).
11040464325 is a wasteful number, since it uses less digits than its factorization.
11040464325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19014 (or 19009 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 11040464325 its reverse (52346404011), we get a palindrome (63386868336).
The spelling of 11040464325 in words is "eleven billion, forty million, four hundred sixty-four thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •