Base | Representation |
---|---|
bin | 1111011000011… |
… | …00101001000101 |
3 | 22222210020021001 |
4 | 13230030221011 |
5 | 231012323004 |
6 | 20445253301 |
7 | 3124464634 |
oct | 754145105 |
9 | 288706231 |
10 | 129026629 |
11 | 66917686 |
12 | 37264231 |
13 | 20967724 |
14 | 131c951b |
15 | b4da1a4 |
hex | 7b0ca45 |
129026629 has 4 divisors (see below), whose sum is σ = 129054060. Its totient is φ = 128999200.
The previous prime is 129026627. The next prime is 129026641. The reversal of 129026629 is 926620921.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 78588225 + 50438404 = 8865^2 + 7102^2 .
It is a cyclic number.
It is not a de Polignac number, because 129026629 - 21 = 129026627 is a prime.
It is a super-2 number, since 2×1290266292 = 33295741982207282, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (129026621) 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 in 3 ways as a sum of consecutive naturals, for example, 4672 + ... + 16729.
It is an arithmetic number, because the mean of its divisors is an integer number (32263515).
Almost surely, 2129026629 is an apocalyptic number.
It is an amenable number.
129026629 is a deficient number, since it is larger than the sum of its proper divisors (27431).
129026629 is an equidigital number, since it uses as much as digits as its factorization.
129026629 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27430.
The product of its (nonzero) digits is 23328, while the sum is 37.
The square root of 129026629 is about 11358.9889074688. The cubic root of 129026629 is about 505.3121998555.
The spelling of 129026629 in words is "one hundred twenty-nine million, twenty-six thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •