Base | Representation |
---|---|
bin | 110101011100010011… |
… | …1011110001111110101 |
3 | 101222020021102111221102 |
4 | 1222320213132033311 |
5 | 3340020211124244 |
6 | 124420100255445 |
7 | 11202010124225 |
oct | 1527047361765 |
9 | 358207374842 |
10 | 114766504949 |
11 | 447437778a8 |
12 | 1a2ab0a1585 |
13 | aa8cb74735 |
14 | 57aa264085 |
15 | 2eba7ca54e |
hex | 1ab89de3f5 |
114766504949 has 2 divisors, whose sum is σ = 114766504950. Its totient is φ = 114766504948.
The previous prime is 114766504939. The next prime is 114766504969. The reversal of 114766504949 is 949405667411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97879502449 + 16887002500 = 312857^2 + 129950^2 .
It is an emirp because it is prime and its reverse (949405667411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 114766504949 - 216 = 114766439413 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 114766504894 and 114766504903.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114766504939) 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, 57383252474 + 57383252475.
It is an arithmetic number, because the mean of its divisors is an integer number (57383252475).
Almost surely, 2114766504949 is an apocalyptic number.
It is an amenable number.
114766504949 is a deficient number, since it is larger than the sum of its proper divisors (1).
114766504949 is an equidigital number, since it uses as much as digits as its factorization.
114766504949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6531840, while the sum is 56.
The spelling of 114766504949 in words is "one hundred fourteen billion, seven hundred sixty-six million, five hundred four thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •