Base | Representation |
---|---|
bin | 110110010011010000… |
… | …0011011010001111110 |
3 | 102010222202120110121212 |
4 | 1230212200123101332 |
5 | 3402304144322200 |
6 | 125323040124422 |
7 | 11265464635214 |
oct | 1544640332176 |
9 | 363882513555 |
10 | 116610151550 |
11 | 454aa432882 |
12 | 1a724606712 |
13 | acc4b07099 |
14 | 590305ccb4 |
15 | 30775a6035 |
hex | 1b2681b47e |
116610151550 has 24 divisors (see below), whose sum is σ = 217794883152. Its totient is φ = 46450512000.
The previous prime is 116610151513. The next prime is 116610151621. The reversal of 116610151550 is 55151016611.
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 (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4826546 + ... + 4850645.
It is an arithmetic number, because the mean of its divisors is an integer number (9074786798).
Almost surely, 2116610151550 is an apocalyptic number.
116610151550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
116610151550 is a deficient number, since it is larger than the sum of its proper divisors (101184731602).
116610151550 is a wasteful number, since it uses less digits than its factorization.
116610151550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9677444 (or 9677439 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 32.
The spelling of 116610151550 in words is "one hundred sixteen billion, six hundred ten million, one hundred fifty-one thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •