Base | Representation |
---|---|
bin | 11010111101010001000100 |
3 | 111022000200100 |
4 | 122331101010 |
5 | 3302113232 |
6 | 411244100 |
7 | 114031413 |
oct | 32752104 |
9 | 14260610 |
10 | 7066692 |
11 | 3a97346 |
12 | 2449630 |
13 | 1605699 |
14 | d1d47a |
15 | 948c7c |
hex | 6bd444 |
7066692 has 36 divisors (see below), whose sum is σ = 18114460. Its totient is φ = 2322432.
The previous prime is 7066643. The next prime is 7066699. The reversal of 7066692 is 2966607.
It can be written as a sum of positive squares in 2 ways, for example, as 1758276 + 5308416 = 1326^2 + 2304^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (7066699) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1284 + ... + 3972.
Almost surely, 27066692 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 7066692, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9057230).
7066692 is an abundant number, since it is smaller than the sum of its proper divisors (11047768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7066692 is a wasteful number, since it uses less digits than its factorization.
7066692 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2772 (or 2767 counting only the distinct ones).
The product of its (nonzero) digits is 27216, while the sum is 36.
The square root of 7066692 is about 2658.3250365597. The cubic root of 7066692 is about 191.8987095941.
The spelling of 7066692 in words is "seven million, sixty-six thousand, six hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •