Base | Representation |
---|---|
bin | 11010011111110101111010… |
… | …010110010011100101110101 |
3 | 120021121212101210120122200102 |
4 | 122133311322112103211311 |
5 | 110233322043434411013 |
6 | 1051504313112323445 |
7 | 33355356263351435 |
oct | 3237657226234565 |
9 | 507555353518612 |
10 | 116537400310133 |
11 | 34150263395660 |
12 | 110a188b6a3585 |
13 | 500457806983a |
14 | 20ac6241602c5 |
15 | d71612946d58 |
hex | 69fd7a593975 |
116537400310133 has 8 divisors (see below), whose sum is σ = 131515561478880. Its totient is φ = 102289881149680.
The previous prime is 116537400310081. The next prime is 116537400310141. The reversal of 116537400310133 is 331013004735611.
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 116537400310133 - 26 = 116537400310069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116537400360133) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 182660501735 + ... + 182660502372.
It is an arithmetic number, because the mean of its divisors is an integer number (16439445184860).
Almost surely, 2116537400310133 is an apocalyptic number.
It is an amenable number.
116537400310133 is a deficient number, since it is larger than the sum of its proper divisors (14978161168747).
116537400310133 is a wasteful number, since it uses less digits than its factorization.
116537400310133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 365321004147.
The product of its (nonzero) digits is 68040, while the sum is 38.
The spelling of 116537400310133 in words is "one hundred sixteen trillion, five hundred thirty-seven billion, four hundred million, three hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •