Base | Representation |
---|---|
bin | 111011011101000… |
… | …010111000011101 |
3 | 2120111220201020011 |
4 | 323131002320131 |
5 | 4020323012400 |
6 | 242551123221 |
7 | 33501232000 |
oct | 7335027035 |
9 | 2514821204 |
10 | 997469725 |
11 | 47205584a |
12 | 23a073511 |
13 | 12b862595 |
14 | 9668d537 |
15 | 5c8818ba |
hex | 3b742e1d |
997469725 has 48 divisors (see below), whose sum is σ = 1459728000. Its totient is φ = 675776640.
The previous prime is 997469723. The next prime is 997469777. The reversal of 997469725 is 527964799.
It is not a de Polignac number, because 997469725 - 21 = 997469723 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 997469725.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (997469723) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 762522 + ... + 763828.
It is an arithmetic number, because the mean of its divisors is an integer number (30411000).
Almost surely, 2997469725 is an apocalyptic number.
It is an amenable number.
997469725 is a deficient number, since it is larger than the sum of its proper divisors (462258275).
997469725 is a wasteful number, since it uses less digits than its factorization.
With its predecessor (997469724) it forms a Ruth-Aaron pair, since the sum of their distinct prime factors is the same (1408).
997469725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1427 (or 1408 counting only the distinct ones).
The product of its digits is 8573040, while the sum is 58.
The square root of 997469725 is about 31582.7441018034. The cubic root of 997469725 is about 999.1558626326.
The spelling of 997469725 in words is "nine hundred ninety-seven million, four hundred sixty-nine thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.171 sec. • engine limits •