Base | Representation |
---|---|
bin | 111111100011011… |
… | …010111101010001 |
3 | 2202022100010010011 |
4 | 333203122331101 |
5 | 4140430000230 |
6 | 253445234521 |
7 | 35264655526 |
oct | 7743327521 |
9 | 2668303104 |
10 | 1066250065 |
11 | 4a7963501 |
12 | 259102a41 |
13 | 13cb94bca |
14 | a187514d |
15 | 6391ae2a |
hex | 3f8daf51 |
1066250065 has 8 divisors (see below), whose sum is σ = 1301186880. Its totient is φ = 838542192.
The previous prime is 1066250063. The next prime is 1066250069. The reversal of 1066250065 is 5600526601.
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 1066250065 - 21 = 1066250063 is a prime.
It is a super-2 number, since 2×10662500652 = 2273778402225008450, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1066250063) 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 in 7 ways as a sum of consecutive naturals, for example, 1806909 + ... + 1807498.
It is an arithmetic number, because the mean of its divisors is an integer number (162648360).
Almost surely, 21066250065 is an apocalyptic number.
It is an amenable number.
1066250065 is a deficient number, since it is larger than the sum of its proper divisors (234936815).
1066250065 is an equidigital number, since it uses as much as digits as its factorization.
1066250065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3614471.
The product of its (nonzero) digits is 10800, while the sum is 31.
The square root of 1066250065 is about 32653.4847298110. The cubic root of 1066250065 is about 1021.6128734590.
Adding to 1066250065 its reverse (5600526601), we get a palindrome (6666776666).
The spelling of 1066250065 in words is "one billion, sixty-six million, two hundred fifty thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •