Base | Representation |
---|---|
bin | 110001101010001… |
… | …1111100010110010 |
3 | 11022010110122110200 |
4 | 1203110133202302 |
5 | 11403034111331 |
6 | 433202540030 |
7 | 56202312333 |
oct | 14324374262 |
9 | 4263418420 |
10 | 1666316466 |
11 | 785657251 |
12 | 3a6067616 |
13 | 2072b4a99 |
14 | 11b43828a |
15 | 9b44d5e6 |
hex | 6351f8b2 |
1666316466 has 96 divisors (see below), whose sum is σ = 3872074752. Its totient is φ = 516737760.
The previous prime is 1666316459. The next prime is 1666316471. The reversal of 1666316466 is 6646136661.
1666316466 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×16663164662 = 5553221129725458312, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2439361 + ... + 2440043.
It is an arithmetic number, because the mean of its divisors is an integer number (40334112).
Almost surely, 21666316466 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1666316466, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1936037376).
1666316466 is an abundant number, since it is smaller than the sum of its proper divisors (2205758286).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1666316466 is a wasteful number, since it uses less digits than its factorization.
1666316466 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 868 (or 865 counting only the distinct ones).
The product of its digits is 559872, while the sum is 45.
The square root of 1666316466 is about 40820.5397563531. The cubic root of 1666316466 is about 1185.5480539193.
The spelling of 1666316466 in words is "one billion, six hundred sixty-six million, three hundred sixteen thousand, four hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •