Base | Representation |
---|---|
bin | 110110011100001010… |
… | …1011001111001101000 |
3 | 102011202121101100120201 |
4 | 1230320111121321220 |
5 | 3403412232032300 |
6 | 125412443001544 |
7 | 11306056150606 |
oct | 1547025317150 |
9 | 364677340521 |
10 | 116909252200 |
11 | 456432525a4 |
12 | 1a7a88092b4 |
13 | b041a7b710 |
14 | 5930a7a876 |
15 | 309398866a |
hex | 1b38559e68 |
116909252200 has 96 divisors (see below), whose sum is σ = 302165660160. Its totient is φ = 41773996800.
The previous prime is 116909252197. The next prime is 116909252221. The reversal of 116909252200 is 2252909611.
It is a self number, because there is not a number n which added to its sum of digits gives 116909252200.
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 23 ways as a sum of consecutive naturals, for example, 644644 + ... + 805843.
It is an arithmetic number, because the mean of its divisors is an integer number (3147558960).
Almost surely, 2116909252200 is an apocalyptic number.
116909252200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
116909252200 is an abundant number, since it is smaller than the sum of its proper divisors (185256407960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116909252200 is a wasteful number, since it uses less digits than its factorization.
116909252200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1450547 (or 1450538 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 37.
The spelling of 116909252200 in words is "one hundred sixteen billion, nine hundred nine million, two hundred fifty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.059 sec. • engine limits •