Search a number
-
+
10490151 = 374311617
BaseRepresentation
bin101000000001…
…000100100111
3201201221210010
4220001010213
510141141101
61012501303
7155110350
oct50010447
921657703
1010490151
115a15451
12361a833
1322339b9
141570d27
15dc32d6
hexa01127

10490151 has 16 divisors (see below), whose sum is σ = 16358144. Its totient is φ = 5854464.

The previous prime is 10490149. The next prime is 10490159. The reversal of 10490151 is 15109401.

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

It is not a de Polignac number, because 10490151 - 21 = 10490149 is a prime.

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

It is a Harshad number since it is a multiple of its sum of digits (21).

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4906 + ... + 6711.

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

Almost surely, 210490151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 11670.

The product of its (nonzero) digits is 180, while the sum is 21.

The square root of 10490151 is about 3238.8502589654. The cubic root of 10490151 is about 218.9074690935.

Adding to 10490151 its reverse (15109401), we get a palindrome (25599552).

The spelling of 10490151 in words is "ten million, four hundred ninety thousand, one hundred fifty-one".

Divisors: 1 3 7 21 43 129 301 903 11617 34851 81319 243957 499531 1498593 3496717 10490151