Base | Representation |
---|---|
bin | 1101100110000… |
… | …00000000000001 |
3 | 21221120110101011 |
4 | 12303000000001 |
5 | 213143021031 |
6 | 15152040521 |
7 | 2553155452 |
oct | 663000001 |
9 | 257513334 |
10 | 114032641 |
11 | 59406458 |
12 | 32233141 |
13 | 1a817a48 |
14 | 11205129 |
15 | a0276b1 |
hex | 6cc0001 |
114032641 has 2 divisors, whose sum is σ = 114032642. Its totient is φ = 114032640.
The previous prime is 114032599. The next prime is 114032657. The reversal of 114032641 is 146230411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77369616 + 36663025 = 8796^2 + 6055^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114032641 is a prime.
It is not a weakly prime, because it can be changed into another prime (114032041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57016320 + 57016321.
It is an arithmetic number, because the mean of its divisors is an integer number (57016321).
It is a Proth number, since it is equal to 435 ⋅ 218 + 1 and 435 < 218.
Almost surely, 2114032641 is an apocalyptic number.
It is an amenable number.
114032641 is a deficient number, since it is larger than the sum of its proper divisors (1).
114032641 is an equidigital number, since it uses as much as digits as its factorization.
114032641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
The square root of 114032641 is about 10678.6066975051. The cubic root of 114032641 is about 484.9270319247.
The spelling of 114032641 in words is "one hundred fourteen million, thirty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •