Base | Representation |
---|---|
bin | 11010011000100111111100… |
… | …010110000000001000010001 |
3 | 120012212110001020202012202121 |
4 | 122120213330112000020101 |
5 | 110202210203423442121 |
6 | 1050444400035414241 |
7 | 33304466126331640 |
oct | 3230477426001021 |
9 | 505773036665677 |
10 | 116041365062161 |
11 | 33a79959427030 |
12 | 11021716454381 |
13 | 4c9986644b8a6 |
14 | 2092609717357 |
15 | d6377ee25141 |
hex | 6989fc580211 |
116041365062161 has 32 divisors (see below), whose sum is σ = 145435105640448. Its totient is φ = 89946812759040.
The previous prime is 116041365062153. The next prime is 116041365062171. The reversal of 116041365062161 is 161260563140611.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 116041365062161 - 23 = 116041365062153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116041365062101) 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 31 ways as a sum of consecutive naturals, for example, 209903070 + ... + 210455176.
It is an arithmetic number, because the mean of its divisors is an integer number (4544847051264).
Almost surely, 2116041365062161 is an apocalyptic number.
116041365062161 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
116041365062161 is a deficient number, since it is larger than the sum of its proper divisors (29393740578287).
116041365062161 is a wasteful number, since it uses less digits than its factorization.
116041365062161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 566461.
The product of its (nonzero) digits is 155520, while the sum is 43.
The spelling of 116041365062161 in words is "one hundred sixteen trillion, forty-one billion, three hundred sixty-five million, sixty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •