Base | Representation |
---|---|
bin | 1010001001000001011010… |
… | …1001110100010000010110 |
3 | 1110110221101200210222112021 |
4 | 2202100112221310100112 |
5 | 2430140413440123420 |
6 | 35414143040243354 |
7 | 2230366151043262 |
oct | 242202651642026 |
9 | 43427350728467 |
10 | 11150115161110 |
11 | 3609812364332 |
12 | 1300b7301055a |
13 | 62b5b37c4a83 |
14 | 2a79503430a2 |
15 | 1450904357aa |
hex | a2416a74416 |
11150115161110 has 8 divisors (see below), whose sum is σ = 20070207290016. Its totient is φ = 4460046064440.
The previous prime is 11150115161093. The next prime is 11150115161137. The reversal of 11150115161110 is 1116151105111.
It is a sphenic number, since it is the product of 3 distinct primes.
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 3 ways as a sum of consecutive naturals, for example, 557505758046 + ... + 557505758065.
It is an arithmetic number, because the mean of its divisors is an integer number (2508775911252).
Almost surely, 211150115161110 is an apocalyptic number.
11150115161110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11150115161110 is a deficient number, since it is larger than the sum of its proper divisors (8920092128906).
11150115161110 is a wasteful number, since it uses less digits than its factorization.
11150115161110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1115011516118.
The product of its (nonzero) digits is 150, while the sum is 25.
Adding to 11150115161110 its reverse (1116151105111), we get a palindrome (12266266266221).
The spelling of 11150115161110 in words is "eleven trillion, one hundred fifty billion, one hundred fifteen million, one hundred sixty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •