Base | Representation |
---|---|
bin | 11010100010101000000001… |
… | …011011100100101111111001 |
3 | 120022022011000222112110102021 |
4 | 122202220001123210233321 |
5 | 110244440231131120223 |
6 | 1052132222125434441 |
7 | 33405236434035112 |
oct | 3242500133445771 |
9 | 508264028473367 |
10 | 116728645176313 |
11 | 34214382102175 |
12 | 1111296310ba21 |
13 | 5019605571451 |
14 | 20b79a756b209 |
15 | d765a745c65d |
hex | 6a2a016e4bf9 |
116728645176313 has 8 divisors (see below), whose sum is σ = 117340096006656. Its totient is φ = 116117197534800.
The previous prime is 116728645176301. The next prime is 116728645176317. The reversal of 116728645176313 is 313671546827611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 116728645176313 - 217 = 116728645045241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116728645176317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 122033095 + ... + 122985907.
It is an arithmetic number, because the mean of its divisors is an integer number (14667512000832).
Almost surely, 2116728645176313 is an apocalyptic number.
It is an amenable number.
116728645176313 is a deficient number, since it is larger than the sum of its proper divisors (611450830343).
116728645176313 is an equidigital number, since it uses as much as digits as its factorization.
116728645176313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1594415.
The product of its digits is 30481920, while the sum is 61.
The spelling of 116728645176313 in words is "one hundred sixteen trillion, seven hundred twenty-eight billion, six hundred forty-five million, one hundred seventy-six thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •