Base | Representation |
---|---|
bin | 111111100100000… |
… | …010100011000001 |
3 | 2202022122100120002 |
4 | 333210002203001 |
5 | 4141000142400 |
6 | 253452525345 |
7 | 35266232354 |
oct | 7744024301 |
9 | 2668570502 |
10 | 1066412225 |
11 | 4a7a6431a |
12 | 259180855 |
13 | 13cc20968 |
14 | a18b829b |
15 | 6394ded5 |
hex | 3f9028c1 |
1066412225 has 6 divisors (see below), whose sum is σ = 1322351190. Its totient is φ = 853129760.
The previous prime is 1066412219. The next prime is 1066412233. The reversal of 1066412225 is 5222146601.
It can be written as a sum of positive squares in 3 ways, for example, as 62853184 + 1003559041 = 7928^2 + 31679^2 .
It is not a de Polignac number, because 1066412225 - 24 = 1066412209 is a prime.
It is a super-2 number, since 2×10664122252 = 2274470067258901250, which contains 22 as substring.
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 5 ways as a sum of consecutive naturals, for example, 21328220 + ... + 21328269.
It is an arithmetic number, because the mean of its divisors is an integer number (220391865).
Almost surely, 21066412225 is an apocalyptic number.
It is an amenable number.
1066412225 is a deficient number, since it is larger than the sum of its proper divisors (255938965).
1066412225 is an equidigital number, since it uses as much as digits as its factorization.
1066412225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42656499 (or 42656494 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 29.
The square root of 1066412225 is about 32655.9676782055. The cubic root of 1066412225 is about 1021.6646612936.
Adding to 1066412225 its reverse (5222146601), we get a palindrome (6288558826).
The spelling of 1066412225 in words is "one billion, sixty-six million, four hundred twelve thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •