Search a number
-
+
695032 = 231341163
BaseRepresentation
bin10101001101011111000
31022022101221
42221223320
5134220112
622521424
75623222
oct2515370
91268357
10695032
11435208
12296274
131b4480
14141412
15dae07
hexa9af8

695032 has 32 divisors (see below), whose sum is σ = 1446480. Its totient is φ = 311040.

The previous prime is 695021. The next prime is 695047. The reversal of 695032 is 230596.

It is a Smith number, since the sum of its digits (25) 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 = 694988 and 695006.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4183 + ... + 4345.

2695032 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 695032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (723240).

695032 is an abundant number, since it is smaller than the sum of its proper divisors (751448).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

695032 is a wasteful number, since it uses less digits than its factorization.

695032 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 223 (or 219 counting only the distinct ones).

The product of its (nonzero) digits is 1620, while the sum is 25.

The square root of 695032 is about 833.6857921303. The cubic root of 695032 is about 88.5798485628.

The spelling of 695032 in words is "six hundred ninety-five thousand, thirty-two".

Divisors: 1 2 4 8 13 26 41 52 82 104 163 164 326 328 533 652 1066 1304 2119 2132 4238 4264 6683 8476 13366 16952 26732 53464 86879 173758 347516 695032