Base | Representation |
---|---|
bin | 111111100010100… |
… | …010110000010100 |
3 | 2202021220102100001 |
4 | 333202202300110 |
5 | 4140400113420 |
6 | 253440301044 |
7 | 35263006423 |
oct | 7742426024 |
9 | 2667812301 |
10 | 1066019860 |
11 | 4a7816554 |
12 | 259011784 |
13 | 13cb141a9 |
14 | a18152ba |
15 | 638c2b0a |
hex | 3f8a2c14 |
1066019860 has 12 divisors (see below), whose sum is σ = 2238641748. Its totient is φ = 426407936.
The previous prime is 1066019827. The next prime is 1066019861. The reversal of 1066019860 is 689106601.
It can be written as a sum of positive squares in 2 ways, for example, as 533887236 + 532132624 = 23106^2 + 23068^2 .
It is a super-2 number, since 2×10660198602 = 2272796683828839200, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1066019861) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26650477 + ... + 26650516.
It is an arithmetic number, because the mean of its divisors is an integer number (186553479).
Almost surely, 21066019860 is an apocalyptic number.
1066019860 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1066019860 is an abundant number, since it is smaller than the sum of its proper divisors (1172621888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1066019860 is a wasteful number, since it uses less digits than its factorization.
1066019860 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53301002 (or 53301000 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 37.
The square root of 1066019860 is about 32649.9595711848. The cubic root of 1066019860 is about 1021.5393455795.
The spelling of 1066019860 in words is "one billion, sixty-six million, nineteen thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •