Base | Representation |
---|---|
bin | 1101100110100… |
… | …10001011111011 |
3 | 21221201020120001 |
4 | 12303102023323 |
5 | 213202412011 |
6 | 15153413431 |
7 | 2553615565 |
oct | 663221373 |
9 | 257636501 |
10 | 114107131 |
11 | 59457416 |
12 | 3226a277 |
13 | 1a842918 |
14 | 11224335 |
15 | a03e7c1 |
hex | 6cd22fb |
114107131 has 2 divisors, whose sum is σ = 114107132. Its totient is φ = 114107130.
The previous prime is 114107113. The next prime is 114107143. The reversal of 114107131 is 131701411.
It is a happy number.
Together with previous prime (114107113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is an emirp because it is prime and its reverse (131701411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 114107131 - 25 = 114107099 is a prime.
It is a super-2 number, since 2×1141071312 = 26040874690102322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114107099 and 114107108.
It is not a weakly prime, because it can be changed into another prime (114107101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57053565 + 57053566.
It is an arithmetic number, because the mean of its divisors is an integer number (57053566).
Almost surely, 2114107131 is an apocalyptic number.
114107131 is a deficient number, since it is larger than the sum of its proper divisors (1).
114107131 is an equidigital number, since it uses as much as digits as its factorization.
114107131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 19.
The square root of 114107131 is about 10682.0939426687. The cubic root of 114107131 is about 485.0325992188.
Adding to 114107131 its reverse (131701411), we get a palindrome (245808542).
The spelling of 114107131 in words is "one hundred fourteen million, one hundred seven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •