Base | Representation |
---|---|
bin | 110110010001000110… |
… | …1010001000000101000 |
3 | 102010210201211210120112 |
4 | 1230202031101000220 |
5 | 3402132213114010 |
6 | 125311542113452 |
7 | 11263630552622 |
oct | 1544215210050 |
9 | 363721753515 |
10 | 116538019880 |
11 | 45472746227 |
12 | 1a70441b888 |
13 | acb2ba0219 |
14 | 58d7643c12 |
15 | 30710a8a05 |
hex | 1b22351028 |
116538019880 has 32 divisors (see below), whose sum is σ = 277634696040. Its totient is φ = 43873136640.
The previous prime is 116538019879. The next prime is 116538019903. The reversal of 116538019880 is 88910835611.
116538019880 = 827882 + 827892 + ... + 828042.
It can be written as a sum of positive squares in 4 ways, for example, as 69159532324 + 47378487556 = 262982^2 + 217666^2 .
It is a super-5 number, since 5×1165380198805 (a number of 57 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 85689041 + ... + 85690400.
Almost surely, 2116538019880 is an apocalyptic number.
116538019880 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
116538019880 is an abundant number, since it is smaller than the sum of its proper divisors (161096676160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116538019880 is a wasteful number, since it uses less digits than its factorization.
116538019880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171379469 (or 171379465 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 50.
The spelling of 116538019880 in words is "one hundred sixteen billion, five hundred thirty-eight million, nineteen thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •