Base | Representation |
---|---|
bin | 1010000001001010100001… |
… | …1000100011011111000010 |
3 | 1110000000221201202222211111 |
4 | 2200102220120203133002 |
5 | 2420432432003443114 |
6 | 35232135442233534 |
7 | 2214546653660332 |
oct | 240225030433702 |
9 | 43000851688744 |
10 | 11015121156034 |
11 | 3567539802286 |
12 | 129a9799558aa |
13 | 61b94c0b0268 |
14 | 2a11c58d70c2 |
15 | 1417dde51bc4 |
hex | a04a86237c2 |
11015121156034 has 8 divisors (see below), whose sum is σ = 16522708644108. Its totient is φ = 5507551608000.
The previous prime is 11015121156019. The next prime is 11015121156043. The reversal of 11015121156034 is 43065112151011.
It can be written as a sum of positive squares in 2 ways, for example, as 10954014799225 + 61106356809 = 3309685^2 + 247197^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 11015121155987 and 11015121156005.
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 3 ways as a sum of consecutive naturals, for example, 2827507 + ... + 5479510.
Almost surely, 211015121156034 is an apocalyptic number.
11015121156034 is a deficient number, since it is larger than the sum of its proper divisors (5507587488074).
11015121156034 is an equidigital number, since it uses as much as digits as its factorization.
11015121156034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8970020.
The product of its (nonzero) digits is 3600, while the sum is 31.
The spelling of 11015121156034 in words is "eleven trillion, fifteen billion, one hundred twenty-one million, one hundred fifty-six thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •