Base | Representation |
---|---|
bin | 1100011010101001… |
… | …10001010100110110 |
3 | 122012120020212110200 |
4 | 12031110301110312 |
5 | 102122443442140 |
6 | 3021243301330 |
7 | 324122030241 |
oct | 61524612466 |
9 | 18176225420 |
10 | 6665999670 |
11 | 2910868240 |
12 | 136051a846 |
13 | 823062405 |
14 | 473456258 |
15 | 290341030 |
hex | 18d531536 |
6665999670 has 96 divisors (see below), whose sum is σ = 19016977824. Its totient is φ = 1606617600.
The previous prime is 6665999623. The next prime is 6665999671. The reversal of 6665999670 is 769995666.
It is a junction number, because it is equal to n+sod(n) for n = 6665999598 and 6665999607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6665999671) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 151810 + ... + 190730.
It is an arithmetic number, because the mean of its divisors is an integer number (198093519).
Almost surely, 26665999670 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6665999670, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9508488912).
6665999670 is an abundant number, since it is smaller than the sum of its proper divisors (12350978154).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6665999670 is a wasteful number, since it uses less digits than its factorization.
6665999670 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39118 (or 39115 counting only the distinct ones).
The product of its (nonzero) digits is 33067440, while the sum is 63.
The square root of 6665999670 is about 81645.5734868707. The cubic root of 6665999670 is about 1882.0092888792.
The spelling of 6665999670 in words is "six billion, six hundred sixty-five million, nine hundred ninety-nine thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •