Search a number
-
+
10497695 = 513161503
BaseRepresentation
bin101000000010…
…111010011111
3201202100010112
4220002322133
510141411240
61013000235
7155141345
oct50027237
921670115
1010497695
115a2008a
12362307b
132237270
141573995
15dc5665
hexa02e9f

10497695 has 8 divisors (see below), whose sum is σ = 13566336. Its totient is φ = 7752096.

The previous prime is 10497691. The next prime is 10497701. The reversal of 10497695 is 59679401.

10497695 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 10497695 - 22 = 10497691 is a prime.

It is a super-2 number, since 2×104976952 = 220403200626050, which contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10497691) by changing a digit.

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

It is an arithmetic number, because the mean of its divisors is an integer number (1695792).

Almost surely, 210497695 is an apocalyptic number.

10497695 is a deficient number, since it is larger than the sum of its proper divisors (3068641).

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

10497695 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 161521.

The product of its (nonzero) digits is 68040, while the sum is 41.

The square root of 10497695 is about 3240.0146604607. The cubic root of 10497695 is about 218.9599323430.

The spelling of 10497695 in words is "ten million, four hundred ninety-seven thousand, six hundred ninety-five".

Divisors: 1 5 13 65 161503 807515 2099539 10497695