Base | Representation |
---|---|
bin | 110110111000001… |
… | …011101100110001 |
3 | 2101011110021201221 |
4 | 312320023230301 |
5 | 3341144311044 |
6 | 231205425041 |
7 | 31546541464 |
oct | 6670135461 |
9 | 2334407657 |
10 | 920697649 |
11 | 432789853 |
12 | 21840b181 |
13 | 118992511 |
14 | 8a3c72db |
15 | 55c69484 |
hex | 36e0bb31 |
920697649 has 9 divisors (see below), whose sum is σ = 972314667. Its totient is φ = 871693704.
The previous prime is 920697629. The next prime is 920697689. The reversal of 920697649 is 946796029.
The square root of 920697649 is 30343.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 184552225 + 736145424 = 13585^2 + 27132^2 .
It is not a de Polignac number, because 920697649 - 225 = 887143217 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 920697596 and 920697605.
It is not an unprimeable number, because it can be changed into a prime (920697629) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 575719 + ... + 577315.
It is an arithmetic number, because the mean of its divisors is an integer number (108034963).
Almost surely, 2920697649 is an apocalyptic number.
920697649 is the 30343-rd square number.
920697649 is the 15172-nd centered octagonal number.
It is an amenable number.
920697649 is a deficient number, since it is larger than the sum of its proper divisors (51617018).
920697649 is an frugal number, since it uses more digits than its factorization.
920697649 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3232 (or 1616 counting only the distinct ones).
The product of its (nonzero) digits is 1469664, while the sum is 52.
The cubic root of 920697649 is about 972.8346067197.
The spelling of 920697649 in words is "nine hundred twenty million, six hundred ninety-seven thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •