Base | Representation |
---|---|
bin | 101001100000001… |
… | …010011001100000 |
3 | 1210112012112222212 |
4 | 221200022121200 |
5 | 2411223001211 |
6 | 153032021252 |
7 | 23153266400 |
oct | 5140123140 |
9 | 1715175885 |
10 | 696297056 |
11 | 328050314 |
12 | 175231828 |
13 | b1343ac0 |
14 | 68692800 |
15 | 411e038b |
hex | 2980a660 |
696297056 has 72 divisors (see below), whose sum is σ = 1717359840. Its totient is φ = 275450112.
The previous prime is 696297029. The next prime is 696297097. The reversal of 696297056 is 650792696.
It is a Smith number, since the sum of its digits (50) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 696296995 and 696297013.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3305 + ... + 37463.
It is an arithmetic number, because the mean of its divisors is an integer number (23852220).
Almost surely, 2696297056 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 696297056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (858679920).
696297056 is an abundant number, since it is smaller than the sum of its proper divisors (1021062784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
696297056 is a wasteful number, since it uses less digits than its factorization.
696297056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34196 (or 34181 counting only the distinct ones).
The product of its (nonzero) digits is 1224720, while the sum is 50.
The square root of 696297056 is about 26387.4412552638. The cubic root of 696297056 is about 886.3355858391.
The spelling of 696297056 in words is "six hundred ninety-six million, two hundred ninety-seven thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •