Base | Representation |
---|---|
bin | 1101101001100… |
… | …01110000010101 |
3 | 21222110010112012 |
4 | 12310301300111 |
5 | 213302423311 |
6 | 15210034005 |
7 | 2560136051 |
oct | 664616025 |
9 | 258403465 |
10 | 114498581 |
11 | 596a452a |
12 | 32418905 |
13 | 1a94bb52 |
14 | 112c6c61 |
15 | a0ba78b |
hex | 6d31c15 |
114498581 has 2 divisors, whose sum is σ = 114498582. Its totient is φ = 114498580.
The previous prime is 114498569. The next prime is 114498613. The reversal of 114498581 is 185894411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106708900 + 7789681 = 10330^2 + 2791^2 .
It is an emirp because it is prime and its reverse (185894411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 114498581 - 214 = 114482197 is a prime.
It is a super-2 number, since 2×1144985812 = 26219850102027122, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114498481) 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, 57249290 + 57249291.
It is an arithmetic number, because the mean of its divisors is an integer number (57249291).
Almost surely, 2114498581 is an apocalyptic number.
It is an amenable number.
114498581 is a deficient number, since it is larger than the sum of its proper divisors (1).
114498581 is an equidigital number, since it uses as much as digits as its factorization.
114498581 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 46080, while the sum is 41.
The square root of 114498581 is about 10700.4009737953. The cubic root of 114498581 is about 485.5866087340.
The spelling of 114498581 in words is "one hundred fourteen million, four hundred ninety-eight thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.214 sec. • engine limits •