Base | Representation |
---|---|
bin | 11110011110110011100101 |
3 | 120000221220111 |
4 | 132132303211 |
5 | 4021144001 |
6 | 443133021 |
7 | 124626631 |
oct | 36366345 |
9 | 16027814 |
10 | 7990501 |
11 | 4568422 |
12 | 2814171 |
13 | 186a00c |
14 | 10bddc1 |
15 | a7c851 |
hex | 79ece5 |
7990501 has 4 divisors (see below), whose sum is σ = 8001612. Its totient is φ = 7979392.
The previous prime is 7990481. The next prime is 7990519. The reversal of 7990501 is 1050997.
7990501 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 422500 + 7568001 = 650^2 + 2751^2 .
It is a cyclic number.
It is not a de Polignac number, because 7990501 - 27 = 7990373 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (7990001) 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, 4396 + ... + 5941.
It is an arithmetic number, because the mean of its divisors is an integer number (2000403).
Almost surely, 27990501 is an apocalyptic number.
It is an amenable number.
7990501 is a deficient number, since it is larger than the sum of its proper divisors (11111).
7990501 is a wasteful number, since it uses less digits than its factorization.
7990501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11110.
The product of its (nonzero) digits is 2835, while the sum is 31.
The square root of 7990501 is about 2826.7474241608. The cubic root of 7990501 is about 199.9208103158.
The spelling of 7990501 in words is "seven million, nine hundred ninety thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •