Base | Representation |
---|---|
bin | 110110000111101011… |
… | …1110100100111110000 |
3 | 102002222201020100100020 |
4 | 1230033113310213300 |
5 | 3401010314120310 |
6 | 125220333123440 |
7 | 11253042604455 |
oct | 1541727644760 |
9 | 362881210306 |
10 | 116222020080 |
11 | 45320333971 |
12 | 1a636629580 |
13 | ac6258c9aa |
14 | 58a76a782c |
15 | 3053489170 |
hex | 1b0f5f49f0 |
116222020080 has 80 divisors (see below), whose sum is σ = 362445801984. Its totient is φ = 30806944000.
The previous prime is 116222020067. The next prime is 116222020087. The reversal of 116222020080 is 80020222611.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a self number, because there is not a number n which added to its sum of digits gives 116222020080.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116222020087) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1409796 + ... + 1489955.
Almost surely, 2116222020080 is an apocalyptic number.
116222020080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
116222020080 is an abundant number, since it is smaller than the sum of its proper divisors (246223781904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116222020080 is a wasteful number, since it uses less digits than its factorization.
116222020080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2899934 (or 2899928 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 116222020080 its reverse (80020222611), we get a palindrome (196242242691).
The spelling of 116222020080 in words is "one hundred sixteen billion, two hundred twenty-two million, twenty thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •