Base | Representation |
---|---|
bin | 1111011001000… |
… | …00110001110001 |
3 | 22222221102101201 |
4 | 13230200301301 |
5 | 231022442410 |
6 | 20451131201 |
7 | 3125260246 |
oct | 754406161 |
9 | 288842351 |
10 | 129109105 |
11 | 66973644 |
12 | 372a3b01 |
13 | 20996128 |
14 | 1320b5cd |
15 | b50483a |
hex | 7b20c71 |
129109105 has 4 divisors (see below), whose sum is σ = 154930932. Its totient is φ = 103287280.
The previous prime is 129109093. The next prime is 129109117. The reversal of 129109105 is 501901921.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 501901921 = 1327 ⋅378223.
It is an interprime number because it is at equal distance from previous prime (129109093) and next prime (129109117).
It can be written as a sum of positive squares in 2 ways, for example, as 88059456 + 41049649 = 9384^2 + 6407^2 .
It is not a de Polignac number, because 129109105 - 29 = 129108593 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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, 12910906 + ... + 12910915.
It is an arithmetic number, because the mean of its divisors is an integer number (38732733).
Almost surely, 2129109105 is an apocalyptic number.
It is an amenable number.
129109105 is a deficient number, since it is larger than the sum of its proper divisors (25821827).
129109105 is an equidigital number, since it uses as much as digits as its factorization.
129109105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25821826.
The product of its (nonzero) digits is 810, while the sum is 28.
The square root of 129109105 is about 11362.6187562551. The cubic root of 129109105 is about 505.4198449528.
The spelling of 129109105 in words is "one hundred twenty-nine million, one hundred nine thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •