Base | Representation |
---|---|
bin | 1111011100111… |
… | …10111110001101 |
3 | 100000220200102212 |
4 | 13232132332031 |
5 | 231141012442 |
6 | 20510200205 |
7 | 3132542234 |
oct | 756367615 |
9 | 300820385 |
10 | 129625997 |
11 | 67196a26 |
12 | 374b3065 |
13 | 20b17497 |
14 | 13303b1b |
15 | b5a7a82 |
hex | 7b9ef8d |
129625997 has 4 divisors (see below), whose sum is σ = 131187840. Its totient is φ = 128064156.
The previous prime is 129625981. The next prime is 129626011. The reversal of 129625997 is 799526921.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 799526921 = 31 ⋅25791191.
It is a cyclic number.
It is not a de Polignac number, because 129625997 - 24 = 129625981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (129625927) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 780797 + ... + 780962.
It is an arithmetic number, because the mean of its divisors is an integer number (32796960).
Almost surely, 2129625997 is an apocalyptic number.
It is an amenable number.
129625997 is a deficient number, since it is larger than the sum of its proper divisors (1561843).
129625997 is an equidigital number, since it uses as much as digits as its factorization.
129625997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1561842.
The product of its digits is 612360, while the sum is 50.
The square root of 129625997 is about 11385.3413211902. The cubic root of 129625997 is about 506.0934344481.
The spelling of 129625997 in words is "one hundred twenty-nine million, six hundred twenty-five thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •