Base | Representation |
---|---|
bin | 1010011101111110010000… |
… | …1010110101011010000110 |
3 | 1111202100102212010011212212 |
4 | 2213133210022311122012 |
5 | 3002040033112301210 |
6 | 40251350351143422 |
7 | 2265400440624050 |
oct | 247374412653206 |
9 | 44670385104785 |
10 | 11510045431430 |
11 | 3738423641757 |
12 | 135a882b14b72 |
13 | 6565147a80a0 |
14 | 2bb1369868d0 |
15 | 14e609171805 |
hex | a77e42b5686 |
11510045431430 has 32 divisors (see below), whose sum is σ = 25499177573184. Its totient is φ = 3642739652736.
The previous prime is 11510045431421. The next prime is 11510045431453. The reversal of 11510045431430 is 3413454001511.
It is a super-2 number, since 2×115100454314302 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 6324199877 + ... + 6324201696.
It is an arithmetic number, because the mean of its divisors is an integer number (796849299162).
Almost surely, 211510045431430 is an apocalyptic number.
11510045431430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11510045431430 is an abundant number, since it is smaller than the sum of its proper divisors (13989132141754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11510045431430 is a wasteful number, since it uses less digits than its factorization.
11510045431430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12648401600.
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 11510045431430 its reverse (3413454001511), we get a palindrome (14923499432941).
The spelling of 11510045431430 in words is "eleven trillion, five hundred ten billion, forty-five million, four hundred thirty-one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •