Base | Representation |
---|---|
bin | 110110000100111101… |
… | …0101111101010111110 |
3 | 102002202100001020020102 |
4 | 1230021322233222332 |
5 | 3400313402332200 |
6 | 125203303521102 |
7 | 11250552026654 |
oct | 1541172575276 |
9 | 362670036212 |
10 | 116130511550 |
11 | 45283712189 |
12 | 1a60ba59192 |
13 | ac49630231 |
14 | 5899486dd4 |
15 | 304a4106d5 |
hex | 1b09eafabe |
116130511550 has 24 divisors (see below), whose sum is σ = 216028441152. Its totient is φ = 46446680000.
The previous prime is 116130511547. The next prime is 116130511561. The reversal of 116130511550 is 55115031611.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 300275 + ... + 567825.
It is an arithmetic number, because the mean of its divisors is an integer number (9001185048).
Almost surely, 2116130511550 is an apocalyptic number.
116130511550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
116130511550 is a deficient number, since it is larger than the sum of its proper divisors (99897929602).
116130511550 is a wasteful number, since it uses less digits than its factorization.
116130511550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276244 (or 276239 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 29.
The spelling of 116130511550 in words is "one hundred sixteen billion, one hundred thirty million, five hundred eleven thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •