Base | Representation |
---|---|
bin | 1111011101100… |
… | …10110010000101 |
3 | 100001001210202012 |
4 | 13232302302011 |
5 | 231201112031 |
6 | 20512024005 |
7 | 3133330634 |
oct | 756626205 |
9 | 301053665 |
10 | 129707141 |
11 | 67241993 |
12 | 37532005 |
13 | 20b453b5 |
14 | 1332551b |
15 | b5c1b2b |
hex | 7bb2c85 |
129707141 has 2 divisors, whose sum is σ = 129707142. Its totient is φ = 129707140.
The previous prime is 129707113. The next prime is 129707173. The reversal of 129707141 is 141707921.
It is an a-pointer prime, because the next prime (129707173) can be obtained adding 129707141 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 105165025 + 24542116 = 10255^2 + 4954^2 .
It is an emirp because it is prime and its reverse (141707921) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 129707141 - 26 = 129707077 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 129707098 and 129707107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (129707191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 64853570 + 64853571.
It is an arithmetic number, because the mean of its divisors is an integer number (64853571).
Almost surely, 2129707141 is an apocalyptic number.
It is an amenable number.
129707141 is a deficient number, since it is larger than the sum of its proper divisors (1).
129707141 is an equidigital number, since it uses as much as digits as its factorization.
129707141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3528, while the sum is 32.
The square root of 129707141 is about 11388.9042932145. The cubic root of 129707141 is about 506.1990148115.
The spelling of 129707141 in words is "one hundred twenty-nine million, seven hundred seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •