Search a number
-
+
10600152 = 2331014373
BaseRepresentation
bin101000011011…
…111011011000
3201221112200020
4220123323120
510203201102
61015110440
7156046143
oct50337330
921845606
1010600152
115a90062
123672420
132271aa4
14159d05a
15de5bbc
hexa1bed8

10600152 has 32 divisors (see below), whose sum is σ = 26768880. Its totient is φ = 3497600.

The previous prime is 10600151. The next prime is 10600189. The reversal of 10600152 is 25100601.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10600151) 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, 238 + ... + 4610.

Almost surely, 210600152 is an apocalyptic number.

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

It is an amenable number.

10600152 is an abundant number, since it is smaller than the sum of its proper divisors (16168728).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 4483 (or 4479 counting only the distinct ones).

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

The square root of 10600152 is about 3255.7874623507. The cubic root of 10600152 is about 219.6699734876.

Adding to 10600152 its reverse (25100601), we get a palindrome (35700753).

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

Divisors: 1 2 3 4 6 8 12 24 101 202 303 404 606 808 1212 2424 4373 8746 13119 17492 26238 34984 52476 104952 441673 883346 1325019 1766692 2650038 3533384 5300076 10600152