Base | Representation |
---|---|
bin | 11010011111011101101000… |
… | …001110011110111000001110 |
3 | 120021112101002200001010000220 |
4 | 122133131220032132320032 |
5 | 110232410144033344200 |
6 | 1051444321531332210 |
7 | 33353444166341022 |
oct | 3237355016367016 |
9 | 507471080033026 |
10 | 116511326465550 |
11 | 341401a3389275 |
12 | 110988135b1066 |
13 | 5001c8120c733 |
14 | 20ab26d326382 |
15 | d70ad88584a0 |
hex | 69f76839ee0e |
116511326465550 has 96 divisors (see below), whose sum is σ = 308915376936192. Its totient is φ = 28958154862080.
The previous prime is 116511326465549. The next prime is 116511326465587. The reversal of 116511326465550 is 55564623115611.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 116511326465493 and 116511326465502.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 221536944 + ... + 222062243.
It is an arithmetic number, because the mean of its divisors is an integer number (3217868509752).
Almost surely, 2116511326465550 is an apocalyptic number.
116511326465550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
116511326465550 is an abundant number, since it is smaller than the sum of its proper divisors (192404050470642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116511326465550 is a wasteful number, since it uses less digits than its factorization.
116511326465550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443599322 (or 443599317 counting only the distinct ones).
The product of its (nonzero) digits is 3240000, while the sum is 51.
The spelling of 116511326465550 in words is "one hundred sixteen trillion, five hundred eleven billion, three hundred twenty-six million, four hundred sixty-five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •