Base | Representation |
---|---|
bin | 11010100001010010000011… |
… | …000001101100101011001001 |
3 | 120021222022202101112021000220 |
4 | 122201102003001230223021 |
5 | 110241432201004304401 |
6 | 1052021553530220253 |
7 | 33365460664206342 |
oct | 3241220301545311 |
9 | 507868671467026 |
10 | 116636330150601 |
11 | 3418920a737a98 |
12 | 110b8a9ab84689 |
13 | 50109b2c45a91 |
14 | 20b332b00d0c9 |
15 | d73ea2c42336 |
hex | 6a148306cac9 |
116636330150601 has 8 divisors (see below), whose sum is σ = 155515308131040. Its totient is φ = 77757452801952.
The previous prime is 116636330150429. The next prime is 116636330150603. The reversal of 116636330150601 is 106051033636611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 116636330150601 - 230 = 116635256408777 is a prime.
It is a super-2 number, since 2×1166363301506012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (116636330150603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22410660 + ... + 27120293.
It is an arithmetic number, because the mean of its divisors is an integer number (19439413516380).
Almost surely, 2116636330150601 is an apocalyptic number.
It is an amenable number.
116636330150601 is a deficient number, since it is larger than the sum of its proper divisors (38878977980439).
116636330150601 is an equidigital number, since it uses as much as digits as its factorization.
116636330150601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50315895.
The product of its (nonzero) digits is 174960, while the sum is 42.
The spelling of 116636330150601 in words is "one hundred sixteen trillion, six hundred thirty-six billion, three hundred thirty million, one hundred fifty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •