Base | Representation |
---|---|
bin | 111001111110100… |
… | …000110110010101 |
3 | 2111210021201011201 |
4 | 321332200312111 |
5 | 3443002020124 |
6 | 240304032501 |
7 | 33050501242 |
oct | 7176406625 |
9 | 2453251151 |
10 | 972688789 |
11 | 45a06a536 |
12 | 231902731 |
13 | 126696cc7 |
14 | 9327c5c9 |
15 | 5a5d9144 |
hex | 39fa0d95 |
972688789 has 2 divisors, whose sum is σ = 972688790. Its totient is φ = 972688788.
The previous prime is 972688741. The next prime is 972688841. The reversal of 972688789 is 987886279.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 625500100 + 347188689 = 25010^2 + 18633^2 .
It is a cyclic number.
It is not a de Polignac number, because 972688789 - 215 = 972656021 is a prime.
It is a super-2 number, since 2×9726887892 = 1892246960492573042, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 972688789.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (972688709) 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 as a sum of consecutive naturals, namely, 486344394 + 486344395.
It is an arithmetic number, because the mean of its divisors is an integer number (486344395).
Almost surely, 2972688789 is an apocalyptic number.
It is an amenable number.
972688789 is a deficient number, since it is larger than the sum of its proper divisors (1).
972688789 is an equidigital number, since it uses as much as digits as its factorization.
972688789 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 24385536, while the sum is 64.
The square root of 972688789 is about 31187.9590387059. The cubic root of 972688789 is about 990.8121041086.
The spelling of 972688789 in words is "nine hundred seventy-two million, six hundred eighty-eight thousand, seven hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •