Search a number
-
+
10490395 = 52098079
BaseRepresentation
bin101000000001…
…001000011011
3201201222010011
4220001020123
510141143040
61012502351
7155111146
oct50011033
921658104
1010490395
115a15653
12361a9b7
132233b46
14157105d
15dc33ea
hexa0121b

10490395 has 4 divisors (see below), whose sum is σ = 12588480. Its totient is φ = 8392312.

The previous prime is 10490393. The next prime is 10490401. The reversal of 10490395 is 59309401.

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

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 10490395 - 21 = 10490393 is a prime.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1049035 + ... + 1049044.

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

Almost surely, 210490395 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2098084.

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

The square root of 10490395 is about 3238.8879264340. The cubic root of 10490395 is about 218.9091663366.

Adding to 10490395 its reverse (59309401), we get a palindrome (69799796).

The spelling of 10490395 in words is "ten million, four hundred ninety thousand, three hundred ninety-five".

Divisors: 1 5 2098079 10490395