Base | Representation |
---|---|
bin | 110110000110010100… |
… | …0101110101101000001 |
3 | 102002212111212102011000 |
4 | 1230030220232231001 |
5 | 3400412041330031 |
6 | 125212013242213 |
7 | 11251644506040 |
oct | 1541450565501 |
9 | 362774772130 |
10 | 116176120641 |
11 | 452a7433a49 |
12 | 1a623193369 |
13 | ac55c0bb69 |
14 | 58a155a557 |
15 | 304e41e3e6 |
hex | 1b0ca2eb41 |
116176120641 has 16 divisors (see below), whose sum is σ = 196700310400. Its totient is φ = 66386354544.
The previous prime is 116176120639. The next prime is 116176120649. The reversal of 116176120641 is 146021671611.
116176120641 is a `hidden beast` number, since 1 + 1 + 6 + 1 + 7 + 6 + 1 + 2 + 0 + 641 = 666.
It is not a de Polignac number, because 116176120641 - 21 = 116176120639 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 116176120596 and 116176120605.
It is not an unprimeable number, because it can be changed into a prime (116176120649) 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 15 ways as a sum of consecutive naturals, for example, 307344046 + ... + 307344423.
It is an arithmetic number, because the mean of its divisors is an integer number (12293769400).
Almost surely, 2116176120641 is an apocalyptic number.
It is an amenable number.
116176120641 is a deficient number, since it is larger than the sum of its proper divisors (80524189759).
116176120641 is an equidigital number, since it uses as much as digits as its factorization.
116176120641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 614688485 (or 614688479 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 36.
The spelling of 116176120641 in words is "one hundred sixteen billion, one hundred seventy-six million, one hundred twenty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •