Base | Representation |
---|---|
bin | 1010011110100100100010… |
… | …1010100101100100010001 |
3 | 1111210022222000012001021120 |
4 | 2213221020222211210101 |
5 | 3002222104240130340 |
6 | 40300210153112453 |
7 | 2266213206204135 |
oct | 247511052454421 |
9 | 44708860161246 |
10 | 11520321411345 |
11 | 374181711453a |
12 | 13608703b8729 |
13 | 657491703186 |
14 | 2bb82d6293c5 |
15 | 14ea0b3964d0 |
hex | a7a48aa5911 |
11520321411345 has 8 divisors (see below), whose sum is σ = 18432514258176. Its totient is φ = 6144171419376.
The previous prime is 11520321411271. The next prime is 11520321411413. The reversal of 11520321411345 is 54311412302511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11520321411345 - 28 = 11520321411089 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 384010713697 + ... + 384010713726.
It is an arithmetic number, because the mean of its divisors is an integer number (2304064282272).
Almost surely, 211520321411345 is an apocalyptic number.
11520321411345 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11520321411345 is a deficient number, since it is larger than the sum of its proper divisors (6912192846831).
11520321411345 is an equidigital number, since it uses as much as digits as its factorization.
11520321411345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 768021427431.
The product of its (nonzero) digits is 14400, while the sum is 33.
Adding to 11520321411345 its reverse (54311412302511), we get a palindrome (65831733713856).
The spelling of 11520321411345 in words is "eleven trillion, five hundred twenty billion, three hundred twenty-one million, four hundred eleven thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •