Base | Representation |
---|---|
bin | 110110001101001100… |
… | …1001001000001000110 |
3 | 102010110121010222200111 |
4 | 1230122121021001012 |
5 | 3401400132241032 |
6 | 125250540103234 |
7 | 11260446311230 |
oct | 1543231110106 |
9 | 363417128614 |
10 | 116406915142 |
11 | 4540573a301 |
12 | 1a688534b1a |
13 | ac9198895b |
14 | 58c4077250 |
15 | 306480cc47 |
hex | 1b1a649046 |
116406915142 has 8 divisors (see below), whose sum is σ = 199554711696. Its totient is φ = 49888677912.
The previous prime is 116406915139. The next prime is 116406915143. The reversal of 116406915142 is 241519604611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 116406915095 and 116406915104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116406915143) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4157389813 + ... + 4157389840.
It is an arithmetic number, because the mean of its divisors is an integer number (24944338962).
Almost surely, 2116406915142 is an apocalyptic number.
116406915142 is a deficient number, since it is larger than the sum of its proper divisors (83147796554).
116406915142 is an equidigital number, since it uses as much as digits as its factorization.
116406915142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8314779662.
The product of its (nonzero) digits is 51840, while the sum is 40.
The spelling of 116406915142 in words is "one hundred sixteen billion, four hundred six million, nine hundred fifteen thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •