Base | Representation |
---|---|
bin | 111111100010100… |
… | …010010101010001 |
3 | 2202021220022221221 |
4 | 333202202111101 |
5 | 4140400040004 |
6 | 253440245041 |
7 | 35263001401 |
oct | 7742422521 |
9 | 2667808857 |
10 | 1066018129 |
11 | 4a7815220 |
12 | 259010781 |
13 | 13cb13477 |
14 | a1814801 |
15 | 638c2354 |
hex | 3f8a2551 |
1066018129 has 8 divisors (see below), whose sum is σ = 1168009920. Its totient is φ = 964873200.
The previous prime is 1066018033. The next prime is 1066018169. The reversal of 1066018129 is 9218106601.
1066018129 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1066018129 - 27 = 1066018001 is a prime.
It is a super-2 number, since 2×10660181292 = 2272789302713321282, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1066018094 and 1066018103.
It is not an unprimeable number, because it can be changed into a prime (1066018169) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 209077 + ... + 214114.
It is an arithmetic number, because the mean of its divisors is an integer number (146001240).
Almost surely, 21066018129 is an apocalyptic number.
It is an amenable number.
1066018129 is a deficient number, since it is larger than the sum of its proper divisors (101991791).
1066018129 is a wasteful number, since it uses less digits than its factorization.
1066018129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 423431.
The product of its (nonzero) digits is 5184, while the sum is 34.
The square root of 1066018129 is about 32649.9330627185. The cubic root of 1066018129 is about 1021.5387926550.
The spelling of 1066018129 in words is "one billion, sixty-six million, eighteen thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •