Base | Representation |
---|---|
bin | 110110011001111100… |
… | …0100010000100110001 |
3 | 102011120101212100020012 |
4 | 1230303320202010301 |
5 | 3403234122342031 |
6 | 125401214224305 |
7 | 11304161333021 |
oct | 1546370420461 |
9 | 364511770205 |
10 | 116834574641 |
11 | 45605087204 |
12 | 1a7877b5095 |
13 | b02c462b05 |
14 | 5924b9ba81 |
15 | 308c136b2b |
hex | 1b33e22131 |
116834574641 has 6 divisors (see below), whose sum is σ = 123307404642. Its totient is φ = 110685386160.
The previous prime is 116834574617. The next prime is 116834574671. The reversal of 116834574641 is 146475438611.
It can be written as a sum of positive squares in only one way, i.e., 114122352400 + 2712222241 = 337820^2 + 52079^2 .
It is a de Polignac number, because none of the positive numbers 2k-116834574641 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 116834574641.
It is not an unprimeable number, because it can be changed into a prime (116834574671) 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 5 ways as a sum of consecutive naturals, for example, 161820380 + ... + 161821101.
It is an arithmetic number, because the mean of its divisors is an integer number (20551234107).
Almost surely, 2116834574641 is an apocalyptic number.
It is an amenable number.
116834574641 is a deficient number, since it is larger than the sum of its proper divisors (6472830001).
116834574641 is an equidigital number, since it uses as much as digits as its factorization.
116834574641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 323641519 (or 323641500 counting only the distinct ones).
The product of its digits is 1935360, while the sum is 50.
The spelling of 116834574641 in words is "one hundred sixteen billion, eight hundred thirty-four million, five hundred seventy-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •