Base | Representation |
---|---|
bin | 1010011110011000110000… |
… | …1110111101001111000010 |
3 | 1111210000210200112100001110 |
4 | 2213212030032331033002 |
5 | 3002144120433123100 |
6 | 40254524342144150 |
7 | 2266041651120051 |
oct | 247461416751702 |
9 | 44700720470043 |
10 | 11517160051650 |
11 | 3740444663180 |
12 | 1360129722056 |
13 | 6570a9773336 |
14 | 2bb60d81c398 |
15 | 14e8c3a7c250 |
hex | a798c3bd3c2 |
11517160051650 has 48 divisors (see below), whose sum is σ = 31159153016928. Its totient is φ = 2792038800000.
The previous prime is 11517160051627. The next prime is 11517160051651. The reversal of 11517160051650 is 5615006171511.
It is a junction number, because it is equal to n+sod(n) for n = 11517160051599 and 11517160051608.
It is not an unprimeable number, because it can be changed into a prime (11517160051651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3490046851 + ... + 3490050150.
It is an arithmetic number, because the mean of its divisors is an integer number (649149021186).
Almost surely, 211517160051650 is an apocalyptic number.
11517160051650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11517160051650 is an abundant number, since it is smaller than the sum of its proper divisors (19641992965278).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11517160051650 is a wasteful number, since it uses less digits than its factorization.
11517160051650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6980097027 (or 6980097022 counting only the distinct ones).
The product of its (nonzero) digits is 31500, while the sum is 39.
The spelling of 11517160051650 in words is "eleven trillion, five hundred seventeen billion, one hundred sixty million, fifty-one thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •