Base | Representation |
---|---|
bin | 1101100110000… |
… | …11111101101101 |
3 | 21221121021122111 |
4 | 12303003331231 |
5 | 213144031002 |
6 | 15152244021 |
7 | 2553254005 |
oct | 663037555 |
9 | 257537574 |
10 | 114048877 |
11 | 59417678 |
12 | 32240611 |
13 | 1a822257 |
14 | 1120b005 |
15 | a02c3d7 |
hex | 6cc3f6d |
114048877 has 2 divisors, whose sum is σ = 114048878. Its totient is φ = 114048876.
The previous prime is 114048841. The next prime is 114048917. The reversal of 114048877 is 778840411.
It is an a-pointer prime, because the next prime (114048917) can be obtained adding 114048877 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80802121 + 33246756 = 8989^2 + 5766^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114048877 is a prime.
It is a super-2 number, since 2×1140488772 = 26014292689922258, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114048827) 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 as a sum of consecutive naturals, namely, 57024438 + 57024439.
It is an arithmetic number, because the mean of its divisors is an integer number (57024439).
Almost surely, 2114048877 is an apocalyptic number.
It is an amenable number.
114048877 is a deficient number, since it is larger than the sum of its proper divisors (1).
114048877 is an equidigital number, since it uses as much as digits as its factorization.
114048877 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 50176, while the sum is 40.
The square root of 114048877 is about 10679.3668819832. The cubic root of 114048877 is about 484.9500455156.
The spelling of 114048877 in words is "one hundred fourteen million, forty-eight thousand, eight hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •