Base | Representation |
---|---|
bin | 110110010000011010… |
… | …0010110010011100101 |
3 | 102010202002222120110200 |
4 | 1230200310112103211 |
5 | 3402110231221012 |
6 | 125305350341113 |
7 | 11263225462164 |
oct | 1544064262345 |
9 | 363662876420 |
10 | 116514710757 |
11 | 45460575795 |
12 | 1a6b865a799 |
13 | acab0cb843 |
14 | 58d44d73db |
15 | 306e0023dc |
hex | 1b20d164e5 |
116514710757 has 18 divisors (see below), whose sum is σ = 171485452242. Its totient is φ = 76206003744.
The previous prime is 116514710749. The next prime is 116514710759. The reversal of 116514710757 is 757017415611.
116514710757 is a `hidden beast` number, since 1 + 16 + 514 + 71 + 0 + 7 + 57 = 666.
It can be written as a sum of positive squares in 3 ways, for example, as 105651651681 + 10863059076 = 325041^2 + 104226^2 .
It is not a de Polignac number, because 116514710757 - 23 = 116514710749 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116514710759) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 7447219 + ... + 7462847.
It is an arithmetic number, because the mean of its divisors is an integer number (9526969569).
Almost surely, 2116514710757 is an apocalyptic number.
It is an amenable number.
116514710757 is a deficient number, since it is larger than the sum of its proper divisors (54970741485).
116514710757 is an frugal number, since it uses more digits than its factorization.
116514710757 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31317 (or 15685 counting only the distinct ones).
The product of its (nonzero) digits is 205800, while the sum is 45.
The spelling of 116514710757 in words is "one hundred sixteen billion, five hundred fourteen million, seven hundred ten thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •