Search a number
-
+
10469990 = 251046999
BaseRepresentation
bin100111111100…
…001001100110
3201200221010102
4213330021212
510140014430
61012224102
7154664516
oct47741146
921627112
1010469990
115a01293
12360b032
13222777b
141567846
15dbc345
hex9fc266

10469990 has 8 divisors (see below), whose sum is σ = 18846000. Its totient is φ = 4187992.

The previous prime is 10469989. The next prime is 10469993. The reversal of 10469990 is 9996401.

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

It is a Curzon number.

It is a plaindrome in base 13.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 210469990 is an apocalyptic number.

10469990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

10469990 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 1047006.

The product of its (nonzero) digits is 17496, while the sum is 38.

The square root of 10469990 is about 3235.7363922298. The cubic root of 10469990 is about 218.7671398815.

The spelling of 10469990 in words is "ten million, four hundred sixty-nine thousand, nine hundred ninety".

Divisors: 1 2 5 10 1046999 2093998 5234995 10469990