Base | Representation |
---|---|
bin | 1101101001111… |
… | …01000111110101 |
3 | 21222112111101122 |
4 | 12310331013311 |
5 | 213310421031 |
6 | 15211033325 |
7 | 2560421564 |
oct | 664750765 |
9 | 258474348 |
10 | 114545141 |
11 | 59726507 |
12 | 3243b845 |
13 | 1a9670b9 |
14 | 112d9bdb |
15 | a0c947b |
hex | 6d3d1f5 |
114545141 has 2 divisors, whose sum is σ = 114545142. Its totient is φ = 114545140.
The previous prime is 114545117. The next prime is 114545147. The reversal of 114545141 is 141545411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 114041041 + 504100 = 10679^2 + 710^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114545141 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 114545141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114545147) 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, 57272570 + 57272571.
It is an arithmetic number, because the mean of its divisors is an integer number (57272571).
Almost surely, 2114545141 is an apocalyptic number.
It is an amenable number.
114545141 is a deficient number, since it is larger than the sum of its proper divisors (1).
114545141 is an equidigital number, since it uses as much as digits as its factorization.
114545141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1600, while the sum is 26.
The square root of 114545141 is about 10702.5763720704. The cubic root of 114545141 is about 485.6524198804.
The spelling of 114545141 in words is "one hundred fourteen million, five hundred forty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •