Base | Representation |
---|---|
bin | 11010011010010111011110… |
… | …000101101101110001110101 |
3 | 120020021220010221022122001212 |
4 | 122122113132011231301311 |
5 | 110211140431314414001 |
6 | 1051015402533531205 |
7 | 33316235520302465 |
oct | 3232273605556165 |
9 | 506256127278055 |
10 | 116161116560501 |
11 | 3401571aa91181 |
12 | 11040976aa3b05 |
13 | 4ca7c3bcc954c |
14 | 2098329a53ba5 |
15 | d6693d1907bb |
hex | 69a5de16dc75 |
116161116560501 has 4 divisors (see below), whose sum is σ = 116184550319052. Its totient is φ = 116137682801952.
The previous prime is 116161116560497. The next prime is 116161116560507. The reversal of 116161116560501 is 105065611161611.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 102840083820100 + 13321032740401 = 10141010^2 + 3649799^2 .
It is a cyclic number.
It is not a de Polignac number, because 116161116560501 - 22 = 116161116560497 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 (116161116560507) 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, 11716871840 + ... + 11716881753.
It is an arithmetic number, because the mean of its divisors is an integer number (29046137579763).
Almost surely, 2116161116560501 is an apocalyptic number.
It is an amenable number.
116161116560501 is a deficient number, since it is larger than the sum of its proper divisors (23433758551).
116161116560501 is an equidigital number, since it uses as much as digits as its factorization.
116161116560501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23433758550.
The product of its (nonzero) digits is 32400, while the sum is 41.
The spelling of 116161116560501 in words is "one hundred sixteen trillion, one hundred sixty-one billion, one hundred sixteen million, five hundred sixty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •