Base | Representation |
---|---|
bin | 1111011011110… |
… | …00000100001111 |
3 | 100000121120211201 |
4 | 13231320010033 |
5 | 231120413024 |
6 | 20502530331 |
7 | 3131306521 |
oct | 755700417 |
9 | 300546751 |
10 | 129466639 |
11 | 67098225 |
12 | 374369a7 |
13 | 20a8caa3 |
14 | 132a1a11 |
15 | b575744 |
hex | 7b7810f |
129466639 has 4 divisors (see below), whose sum is σ = 129805056. Its totient is φ = 129128224.
The previous prime is 129466621. The next prime is 129466657. The reversal of 129466639 is 936664921.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 936664921 = 12433 ⋅75337.
It is an interprime number because it is at equal distance from previous prime (129466621) and next prime (129466657).
It is a cyclic number.
It is not a de Polignac number, because 129466639 - 25 = 129466607 is a prime.
It is a super-2 number, since 2×1294666392 = 33523221227912642, 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 (129466669) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 168634 + ... + 169399.
It is an arithmetic number, because the mean of its divisors is an integer number (32451264).
Almost surely, 2129466639 is an apocalyptic number.
129466639 is a deficient number, since it is larger than the sum of its proper divisors (338417).
129466639 is an equidigital number, since it uses as much as digits as its factorization.
129466639 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338416.
The product of its digits is 419904, while the sum is 46.
The square root of 129466639 is about 11378.3407841390. The cubic root of 129466639 is about 505.8859577806.
The spelling of 129466639 in words is "one hundred twenty-nine million, four hundred sixty-six thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •