Base | Representation |
---|---|
bin | 110110111000001… |
… | …011101011111100 |
3 | 2101011110021122222 |
4 | 312320023223330 |
5 | 3341144310341 |
6 | 231205424512 |
7 | 31546541360 |
oct | 6670135374 |
9 | 2334407588 |
10 | 920697596 |
11 | 432789805 |
12 | 21840b138 |
13 | 1189924a0 |
14 | 8a3c72a0 |
15 | 55c6944b |
hex | 36e0bafc |
920697596 has 96 divisors (see below), whose sum is σ = 2065620480. Its totient is φ = 349380864.
The previous prime is 920697593. The next prime is 920697601. The reversal of 920697596 is 695796029.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (920697593) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 922970 + ... + 923966.
It is an arithmetic number, because the mean of its divisors is an integer number (21516880).
Almost surely, 2920697596 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 920697596, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1032810240).
920697596 is an abundant number, since it is smaller than the sum of its proper divisors (1144922884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
920697596 is a wasteful number, since it uses less digits than its factorization.
920697596 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1123 (or 1121 counting only the distinct ones).
The product of its (nonzero) digits is 1837080, while the sum is 53.
The square root of 920697596 is about 30342.9991266519. Note that the first 3 decimals coincide. The cubic root of 920697596 is about 972.8345880526.
Adding to 920697596 its sum of digits (53), we get a square (920697649 = 303432).
The spelling of 920697596 in words is "nine hundred twenty million, six hundred ninety-seven thousand, five hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •