Base | Representation |
---|---|
bin | 110110011101010101… |
… | …1010000111001111111 |
3 | 102011212100022020010210 |
4 | 1230322223100321333 |
5 | 3404002311140314 |
6 | 125420405003503 |
7 | 11310044106462 |
oct | 1547253207177 |
9 | 364770266123 |
10 | 116948536959 |
11 | 45663444841 |
12 | 1a7b99b3593 |
13 | b049c54837 |
14 | 5935d852d9 |
15 | 3097148559 |
hex | 1b3aad0e7f |
116948536959 has 32 divisors (see below), whose sum is σ = 163242374400. Its totient is φ = 74379836160.
The previous prime is 116948536889. The next prime is 116948537009. The reversal of 116948536959 is 959635849611.
It is not a de Polignac number, because 116948536959 - 212 = 116948532863 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 116948536959.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116948136959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2528707 + ... + 2574539.
It is an arithmetic number, because the mean of its divisors is an integer number (5101324200).
Almost surely, 2116948536959 is an apocalyptic number.
116948536959 is a deficient number, since it is larger than the sum of its proper divisors (46293837441).
116948536959 is a wasteful number, since it uses less digits than its factorization.
116948536959 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46215.
The product of its digits is 62985600, while the sum is 66.
The spelling of 116948536959 in words is "one hundred sixteen billion, nine hundred forty-eight million, five hundred thirty-six thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •