Search a number
-
+
10314051 = 31123107127
BaseRepresentation
bin100111010110…
…000101000011
3201102000012220
4213112011003
510120022201
61005022123
7153445056
oct47260503
921360186
1010314051
115905110
123554943
1321a17b7
141526a9d
15d8b036
hex9d6143

10314051 has 32 divisors (see below), whose sum is σ = 15925248. Its totient is φ = 5876640.

The previous prime is 10314011. The next prime is 10314061. The reversal of 10314051 is 15041301.

It is not a de Polignac number, because 10314051 - 26 = 10313987 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 10314051.

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 81150 + ... + 81276.

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

Almost surely, 210314051 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 271.

The product of its (nonzero) digits is 60, while the sum is 15.

The square root of 10314051 is about 3211.5496259594. The cubic root of 10314051 is about 217.6756039889.

Adding to 10314051 its reverse (15041301), we get a palindrome (25355352).

The spelling of 10314051 in words is "ten million, three hundred fourteen thousand, fifty-one".

Divisors: 1 3 11 23 33 69 107 127 253 321 381 759 1177 1397 2461 2921 3531 4191 7383 8763 13589 27071 32131 40767 81213 96393 149479 312547 448437 937641 3438017 10314051