Base | Representation |
---|---|
bin | 1010011101101000111100… |
… | …0010001011010111100110 |
3 | 1111201210122222201102020210 |
4 | 2213122033002023113212 |
5 | 3001441322431201210 |
6 | 40245002421040250 |
7 | 2265105553443162 |
oct | 247321702132746 |
9 | 44653588642223 |
10 | 11504322131430 |
11 | 3735a56a20757 |
12 | 1359746256086 |
13 | 655b11b3c93b |
14 | 2bab52803ca2 |
15 | 14e3c1993e20 |
hex | a768f08b5e6 |
11504322131430 has 32 divisors (see below), whose sum is σ = 28501030315008. Its totient is φ = 2968857324000.
The previous prime is 11504322131353. The next prime is 11504322131453. The reversal of 11504322131430 is 3413122340511.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 6185118496 + ... + 6185120355.
It is an arithmetic number, because the mean of its divisors is an integer number (890657197344).
Almost surely, 211504322131430 is an apocalyptic number.
11504322131430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11504322131430 is an abundant number, since it is smaller than the sum of its proper divisors (16996708183578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11504322131430 is a wasteful number, since it uses less digits than its factorization.
11504322131430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12370238892.
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 11504322131430 its reverse (3413122340511), we get a palindrome (14917444471941).
The spelling of 11504322131430 in words is "eleven trillion, five hundred four billion, three hundred twenty-two million, one hundred thirty-one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •