Base | Representation |
---|---|
bin | 1111011100000… |
… | …11010111101101 |
3 | 100000200221100121 |
4 | 13232003113231 |
5 | 231123403231 |
6 | 20503524541 |
7 | 3131561515 |
oct | 756032755 |
9 | 300627317 |
10 | 129512941 |
11 | 67119a98 |
12 | 37459751 |
13 | 20aa7b9c |
14 | 132b4845 |
15 | b584311 |
hex | 7b835ed |
129512941 has 2 divisors, whose sum is σ = 129512942. Its totient is φ = 129512940.
The previous prime is 129512939. The next prime is 129512983. The reversal of 129512941 is 149215921.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 126090441 + 3422500 = 11229^2 + 1850^2 .
It is an emirp because it is prime and its reverse (149215921) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 129512941 - 21 = 129512939 is a prime.
Together with 129512939, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 129512897 and 129512906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (129512641) 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, 64756470 + 64756471.
It is an arithmetic number, because the mean of its divisors is an integer number (64756471).
Almost surely, 2129512941 is an apocalyptic number.
It is an amenable number.
129512941 is a deficient number, since it is larger than the sum of its proper divisors (1).
129512941 is an equidigital number, since it uses as much as digits as its factorization.
129512941 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6480, while the sum is 34.
The square root of 129512941 is about 11380.3752574333. The cubic root of 129512941 is about 505.9462583594.
The spelling of 129512941 in words is "one hundred twenty-nine million, five hundred twelve thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •