Base | Representation |
---|---|
bin | 11010011001011111011111… |
… | …010010101100111110110100 |
3 | 120020002010222210221202011101 |
4 | 122121133133102230332310 |
5 | 110204144330320401210 |
6 | 1050532022201415444 |
7 | 33312010122206152 |
oct | 3231373722547664 |
9 | 506063883852141 |
10 | 116101007200180 |
11 | 33aa21848aa092 |
12 | 110311a049a584 |
13 | 4ca237c9cc212 |
14 | 20954668543d2 |
15 | d650c1039a3a |
hex | 6997df4acfb4 |
116101007200180 has 48 divisors (see below), whose sum is σ = 249501970517184. Its totient is φ = 45356792382720.
The previous prime is 116101007200177. The next prime is 116101007200261. The reversal of 116101007200180 is 81002700101611.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5492944 + ... + 16197976.
It is an arithmetic number, because the mean of its divisors is an integer number (5197957719108).
Almost surely, 2116101007200180 is an apocalyptic number.
116101007200180 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
116101007200180 is an abundant number, since it is smaller than the sum of its proper divisors (133400963317004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116101007200180 is a wasteful number, since it uses less digits than its factorization.
116101007200180 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10717696 (or 10717694 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 28.
Adding to 116101007200180 its reverse (81002700101611), we get a palindrome (197103707301791).
The spelling of 116101007200180 in words is "one hundred sixteen trillion, one hundred one billion, seven million, two hundred thousand, one hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •