Base | Representation |
---|---|
bin | 10000111000101… |
… | …11000010100001 |
3 | 100212112200012011 |
4 | 20130113002201 |
5 | 242230332004 |
6 | 22020032521 |
7 | 3340010653 |
oct | 1034270241 |
9 | 325480164 |
10 | 141652129 |
11 | 72a60383 |
12 | 3b532741 |
13 | 23468338 |
14 | 14b546d3 |
15 | c681004 |
hex | 87170a1 |
141652129 has 2 divisors, whose sum is σ = 141652130. Its totient is φ = 141652128.
The previous prime is 141652127. The next prime is 141652213. The reversal of 141652129 is 921256141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101304225 + 40347904 = 10065^2 + 6352^2 .
It is a cyclic number.
It is not a de Polignac number, because 141652129 - 21 = 141652127 is a prime.
Together with 141652127, it forms a pair of twin primes.
It is a Chen prime.
It is an alternating number because its digits alternate between odd and even.
It is a self number, because there is not a number n which added to its sum of digits gives 141652129.
It is not a weakly prime, because it can be changed into another prime (141652123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70826064 + 70826065.
It is an arithmetic number, because the mean of its divisors is an integer number (70826065).
Almost surely, 2141652129 is an apocalyptic number.
It is an amenable number.
141652129 is a deficient number, since it is larger than the sum of its proper divisors (1).
141652129 is an equidigital number, since it uses as much as digits as its factorization.
141652129 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4320, while the sum is 31.
The square root of 141652129 is about 11901.7699944168. The cubic root of 141652129 is about 521.2839683269.
The spelling of 141652129 in words is "one hundred forty-one million, six hundred fifty-two thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •