Base | Representation |
---|---|
bin | 110110101110111011… |
… | …1111000010111000011 |
3 | 102020101111110020102112 |
4 | 1231131313320113003 |
5 | 3411204443444401 |
6 | 125555141405535 |
7 | 11330504261612 |
oct | 1553567702703 |
9 | 366344406375 |
10 | 117539046851 |
11 | 45936800646 |
12 | 1a9437098ab |
13 | b1123a9985 |
14 | 599057b879 |
15 | 30cddde3bb |
hex | 1b5ddf85c3 |
117539046851 has 2 divisors, whose sum is σ = 117539046852. Its totient is φ = 117539046850.
The previous prime is 117539046829. The next prime is 117539046949. The reversal of 117539046851 is 158640935711.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 117539046851 - 226 = 117471937987 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 117539046851.
It is not a weakly prime, because it can be changed into another prime (117539046151) 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 as a sum of consecutive naturals, namely, 58769523425 + 58769523426.
It is an arithmetic number, because the mean of its divisors is an integer number (58769523426).
Almost surely, 2117539046851 is an apocalyptic number.
117539046851 is a deficient number, since it is larger than the sum of its proper divisors (1).
117539046851 is an equidigital number, since it uses as much as digits as its factorization.
117539046851 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 907200, while the sum is 50.
The spelling of 117539046851 in words is "one hundred seventeen billion, five hundred thirty-nine million, forty-six thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •