Base | Representation |
---|---|
bin | 110001101001111… |
… | …1000100111110000 |
3 | 11022010011112210000 |
4 | 1203103320213300 |
5 | 11403014011130 |
6 | 433155310000 |
7 | 56201046462 |
oct | 14323704760 |
9 | 4263145700 |
10 | 1666157040 |
11 | 785558499 |
12 | 3a5bab300 |
13 | 20725a352 |
14 | 11b3d6132 |
15 | 9b41b260 |
hex | 634f89f0 |
1666157040 has 100 divisors (see below), whose sum is σ = 5786832744. Its totient is φ = 444306816.
The previous prime is 1666157033. The next prime is 1666157047. The reversal of 1666157040 is 407516661.
It is an interprime number because it is at equal distance from previous prime (1666157033) and next prime (1666157047).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 1666156986 and 1666157004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1666157047) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 122082 + ... + 135041.
Almost surely, 21666157040 is an apocalyptic number.
1666157040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1666157040 is an abundant number, since it is smaller than the sum of its proper divisors (4120675704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1666157040 is a wasteful number, since it uses less digits than its factorization.
1666157040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 257148 (or 257133 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The square root of 1666157040 is about 40818.5869427152. The cubic root of 1666157040 is about 1185.5102433321.
The spelling of 1666157040 in words is "one billion, six hundred sixty-six million, one hundred fifty-seven thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •