Base | Representation |
---|---|
bin | 111111100011011… |
… | …011000001000001 |
3 | 2202022100010110001 |
4 | 333203123001001 |
5 | 4140430002210 |
6 | 253445240001 |
7 | 35264656321 |
oct | 7743330101 |
9 | 2668303401 |
10 | 1066250305 |
11 | 4a79636aa |
12 | 259103001 |
13 | 13cb95053 |
14 | a1875281 |
15 | 6391b03a |
hex | 3f8db041 |
1066250305 has 16 divisors (see below), whose sum is σ = 1312056144. Its totient is φ = 831339520.
The previous prime is 1066250291. The next prime is 1066250329. The reversal of 1066250305 is 5030526601.
1066250305 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 244109376 + 822140929 = 15624^2 + 28673^2 .
It is not a de Polignac number, because 1066250305 - 213 = 1066242113 is a prime.
It is a super-2 number, since 2×10662503052 = 2273779425825186050, which contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 259749 + ... + 263821.
It is an arithmetic number, because the mean of its divisors is an integer number (82003509).
Almost surely, 21066250305 is an apocalyptic number.
It is an amenable number.
1066250305 is a deficient number, since it is larger than the sum of its proper divisors (245805839).
1066250305 is a wasteful number, since it uses less digits than its factorization.
1066250305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5396.
The product of its (nonzero) digits is 5400, while the sum is 28.
The square root of 1066250305 is about 32653.4884047631. The cubic root of 1066250305 is about 1021.6129501099.
Adding to 1066250305 its reverse (5030526601), we get a palindrome (6096776906).
The spelling of 1066250305 in words is "one billion, sixty-six million, two hundred fifty thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •