Base | Representation |
---|---|
bin | 1100111111111… |
… | …11111000100101 |
3 | 21121012101102211 |
4 | 12133333320211 |
5 | 210404121204 |
6 | 14453203421 |
7 | 2462631124 |
oct | 637777045 |
9 | 247171384 |
10 | 109051429 |
11 | 56613a53 |
12 | 30630571 |
13 | 19792696 |
14 | 106a9abb |
15 | 9891804 |
hex | 67ffe25 |
109051429 has 2 divisors, whose sum is σ = 109051430. Its totient is φ = 109051428.
The previous prime is 109051427. The next prime is 109051451. The reversal of 109051429 is 924150901.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 60372900 + 48678529 = 7770^2 + 6977^2 .
It is an emirp because it is prime and its reverse (924150901) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 109051429 - 21 = 109051427 is a prime.
Together with 109051427, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 109051429.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (109051427) 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 as a sum of consecutive naturals, namely, 54525714 + 54525715.
It is an arithmetic number, because the mean of its divisors is an integer number (54525715).
Almost surely, 2109051429 is an apocalyptic number.
It is an amenable number.
109051429 is a deficient number, since it is larger than the sum of its proper divisors (1).
109051429 is an equidigital number, since it uses as much as digits as its factorization.
109051429 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 31.
The square root of 109051429 is about 10442.7692208533. The cubic root of 109051429 is about 477.7607344060.
The spelling of 109051429 in words is "one hundred nine million, fifty-one thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •