Search a number
-
+
10690147 = 132335753
BaseRepresentation
bin101000110001…
…111001100011
3202010010010101
4220301321203
510214041042
61021043231
7156602416
oct50617143
922103111
1010690147
116041736
1236b6517
1322a3a40
1415c3b7d
15e126b7
hexa31e63

10690147 has 8 divisors (see below), whose sum is σ = 12013344. Its totient is φ = 9438528.

The previous prime is 10690123. The next prime is 10690157. The reversal of 10690147 is 74109601.

10690147 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 10690147 - 215 = 10657379 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 210690147 is an apocalyptic number.

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

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

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

The sum of its prime factors is 35789.

The product of its (nonzero) digits is 1512, while the sum is 28.

The square root of 10690147 is about 3269.5790248899. The cubic root of 10690147 is about 220.2898864538.

Adding to 10690147 its reverse (74109601), we get a palindrome (84799748).

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

Divisors: 1 13 23 299 35753 464789 822319 10690147