Base | Representation |
---|---|
bin | 1101100110100… |
… | …10010010100101 |
3 | 21221201021010211 |
4 | 12303102102211 |
5 | 213202420212 |
6 | 15153415421 |
7 | 2553620044 |
oct | 663222245 |
9 | 257637124 |
10 | 114107557 |
11 | 59457773 |
12 | 3226a571 |
13 | 1a842b85 |
14 | 1122455b |
15 | a03e9a7 |
hex | 6cd24a5 |
114107557 has 2 divisors, whose sum is σ = 114107558. Its totient is φ = 114107556.
The previous prime is 114107549. The next prime is 114107561. The reversal of 114107557 is 755701411.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106523041 + 7584516 = 10321^2 + 2754^2 .
It is an emirp because it is prime and its reverse (755701411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 114107557 - 23 = 114107549 is a prime.
It is a plaindrome in base 14.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114107507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57053778 + 57053779.
It is an arithmetic number, because the mean of its divisors is an integer number (57053779).
Almost surely, 2114107557 is an apocalyptic number.
It is an amenable number.
114107557 is a deficient number, since it is larger than the sum of its proper divisors (1).
114107557 is an equidigital number, since it uses as much as digits as its factorization.
114107557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4900, while the sum is 31.
The square root of 114107557 is about 10682.1138825609. The cubic root of 114107557 is about 485.0332028142.
Adding to 114107557 its reverse (755701411), we get a palindrome (869808968).
The spelling of 114107557 in words is "one hundred fourteen million, one hundred seven thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •