Search a number
-
+
10653051 = 313127107
BaseRepresentation
bin101000101000…
…110101111011
3202001020020110
4220220311323
510211344201
61020155403
7156356313
oct50506573
922036213
1010653051
116016882
123698b63
13228cba6
1415b4443
15e066d6
hexa28d7b

10653051 has 8 divisors (see below), whose sum is σ = 14313024. Its totient is φ = 7047560.

The previous prime is 10653047. The next prime is 10653059. The reversal of 10653051 is 15035601.

It is a happy number.

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 10653051 - 22 = 10653047 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (10653059) 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 7 ways as a sum of consecutive naturals, for example, 13161 + ... + 13946.

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

Almost surely, 210653051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 27241.

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

The square root of 10653051 is about 3263.9011933574. The cubic root of 10653051 is about 220.0347810024.

Adding to 10653051 its reverse (15035601), we get a palindrome (25688652).

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

Divisors: 1 3 131 393 27107 81321 3551017 10653051