Base | Representation |
---|---|
bin | 101001011101000… |
… | …010101010101000 |
3 | 1210110122222202201 |
4 | 221131002222220 |
5 | 2411020311302 |
6 | 153002305544 |
7 | 23143321300 |
oct | 5135025250 |
9 | 1713588681 |
10 | 695478952 |
11 | 3276416a3 |
12 | 174ab82b4 |
13 | b111860c |
14 | 6851c600 |
15 | 410ccc87 |
hex | 29742aa8 |
695478952 has 48 divisors (see below), whose sum is σ = 1519475220. Its totient is φ = 297561600.
The previous prime is 695478929. The next prime is 695478977. The reversal of 695478952 is 259874596.
It can be written as a sum of positive squares in 2 ways, for example, as 693479556 + 1999396 = 26334^2 + 1414^2 .
It is a junction number, because it is equal to n+sod(n) for n = 695478893 and 695478902.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 320752 + ... + 322912.
Almost surely, 2695478952 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 695478952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (759737610).
695478952 is an abundant number, since it is smaller than the sum of its proper divisors (823996268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
695478952 is a wasteful number, since it uses less digits than its factorization.
695478952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3002 (or 2991 counting only the distinct ones).
The product of its digits is 5443200, while the sum is 55.
The square root of 695478952 is about 26371.9349309071. The cubic root of 695478952 is about 885.9883208056.
The spelling of 695478952 in words is "six hundred ninety-five million, four hundred seventy-eight thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •