Base | Representation |
---|---|
bin | 10000110100101… |
… | …10011001001101 |
3 | 100211112220101011 |
4 | 20122112121031 |
5 | 242112001242 |
6 | 22000445221 |
7 | 3332354503 |
oct | 1032263115 |
9 | 324486334 |
10 | 141125197 |
11 | 727304a4 |
12 | 3b319811 |
13 | 23312545 |
14 | 14a58673 |
15 | c5c9d17 |
hex | 869664d |
141125197 has 2 divisors, whose sum is σ = 141125198. Its totient is φ = 141125196.
The previous prime is 141125119. The next prime is 141125251. The reversal of 141125197 is 791521141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 85488516 + 55636681 = 9246^2 + 7459^2 .
It is an emirp because it is prime and its reverse (791521141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 141125197 - 211 = 141123149 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141125297) 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, 70562598 + 70562599.
It is an arithmetic number, because the mean of its divisors is an integer number (70562599).
Almost surely, 2141125197 is an apocalyptic number.
It is an amenable number.
141125197 is a deficient number, since it is larger than the sum of its proper divisors (1).
141125197 is an equidigital number, since it uses as much as digits as its factorization.
141125197 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2520, while the sum is 31.
The square root of 141125197 is about 11879.6126620357. The cubic root of 141125197 is about 520.6367901370.
It can be divided in two parts, 14 and 1125197, that added together give a palindrome (1125211).
The spelling of 141125197 in words is "one hundred forty-one million, one hundred twenty-five thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •