Base | Representation |
---|---|
bin | 1010000001000000000001… |
… | …1110010110101100010111 |
3 | 1102222202200101222221012221 |
4 | 2200100000132112230113 |
5 | 2420411144322313330 |
6 | 35230552131123211 |
7 | 2214420106302301 |
oct | 240200036265427 |
9 | 42882611887187 |
10 | 11012304104215 |
11 | 3566323638587 |
12 | 129a312443507 |
13 | 61b5c05927ab |
14 | 2a0dd9714971 |
15 | 1416c6999b7a |
hex | a0400796b17 |
11012304104215 has 8 divisors (see below), whose sum is σ = 13641047664768. Its totient is φ = 8525654790240.
The previous prime is 11012304104143. The next prime is 11012304104233. The reversal of 11012304104215 is 51240140321011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11012304104215 - 213 = 11012304096023 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11012304104215.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35523561472 + ... + 35523561781.
It is an arithmetic number, because the mean of its divisors is an integer number (1705130958096).
Almost surely, 211012304104215 is an apocalyptic number.
11012304104215 is a deficient number, since it is larger than the sum of its proper divisors (2628743560553).
11012304104215 is an equidigital number, since it uses as much as digits as its factorization.
11012304104215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71047123289.
The product of its (nonzero) digits is 960, while the sum is 25.
Adding to 11012304104215 its reverse (51240140321011), we get a palindrome (62252444425226).
The spelling of 11012304104215 in words is "eleven trillion, twelve billion, three hundred four million, one hundred four thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •