Base | Representation |
---|---|
bin | 10101011101010010… |
… | …10100000000000101 |
3 | 1002201211220122010212 |
4 | 22232221110000011 |
5 | 142043110000010 |
6 | 5143041325205 |
7 | 555322245563 |
oct | 125651240005 |
9 | 32654818125 |
10 | 11520000005 |
11 | 4981815568 |
12 | 2296036805 |
13 | 1117892b67 |
14 | 7b3d90a33 |
15 | 476558505 |
hex | 2aea54005 |
11520000005 has 4 divisors (see below), whose sum is σ = 13824000012. Its totient is φ = 9216000000.
The previous prime is 11519999989. The next prime is 11520000013. The reversal of 11520000005 is 50000002511.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 50000002511 = 3769 ⋅13266119.
It can be written as a sum of positive squares in 2 ways, for example, as 9215808001 + 2304192004 = 95999^2 + 48002^2 .
It is not a de Polignac number, because 11520000005 - 24 = 11519999989 is a prime.
It is a Duffinian number.
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 3 ways as a sum of consecutive naturals, for example, 1151999996 + ... + 1152000005.
It is an arithmetic number, because the mean of its divisors is an integer number (3456000003).
Almost surely, 211520000005 is an apocalyptic number.
It is an amenable number.
11520000005 is a deficient number, since it is larger than the sum of its proper divisors (2304000007).
11520000005 is an equidigital number, since it uses as much as digits as its factorization.
11520000005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2304000006.
The product of its (nonzero) digits is 50, while the sum is 14.
Adding to 11520000005 its reverse (50000002511), we get a palindrome (61520002516).
The spelling of 11520000005 in words is "eleven billion, five hundred twenty million, five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •