Search a number
-
+
10695145 = 55993571
BaseRepresentation
bin101000110011…
…000111101001
3202010100222111
4220303013221
510214221040
61021122321
7156623116
oct50630751
922110874
1010695145
11604546a
1236b93a1
1322a60b6
1415c590d
15e13dea
hexa331e9

10695145 has 8 divisors (see below), whose sum is σ = 12859200. Its totient is φ = 8539440.

The previous prime is 10695133. The next prime is 10695149. The reversal of 10695145 is 54159601.

10695145 is digitally balanced in base 2 and base 3, because in such bases 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 not a de Polignac number, because 10695145 - 213 = 10686953 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (10695149) 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, 1210 + ... + 4780.

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

Almost surely, 210695145 is an apocalyptic number.

It is an amenable number.

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

10695145 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 4175.

The product of its (nonzero) digits is 5400, while the sum is 31.

The square root of 10695145 is about 3270.3432541554. The cubic root of 10695145 is about 220.3242120595.

The spelling of 10695145 in words is "ten million, six hundred ninety-five thousand, one hundred forty-five".

Divisors: 1 5 599 2995 3571 17855 2139029 10695145