Search a number
-
+
10161152 = 2109923
BaseRepresentation
bin100110110000…
…110000000000
3201010020110222
4212300300000
510100124102
61001442212
7152240231
oct46606000
921106428
1010161152
115810251
1234a0368
13214a021
1414c7088
15d5aaa2
hex9b0c00

10161152 has 22 divisors (see below), whose sum is σ = 20314428. Its totient is φ = 5080064.

The previous prime is 10161133. The next prime is 10161161. The reversal of 10161152 is 25116101.

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

It is an unprimeable number.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3938 + ... + 5985.

Almost surely, 210161152 is an apocalyptic number.

It is an amenable number.

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

10161152 is an frugal number, since it uses more digits than its factorization.

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

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

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

The square root of 10161152 is about 3187.6561922516. The cubic root of 10161152 is about 216.5946122007.

Adding to 10161152 its reverse (25116101), we get a palindrome (35277253).

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

Divisors: 1 2 4 8 16 32 64 128 256 512 1024 9923 19846 39692 79384 158768 317536 635072 1270144 2540288 5080576 10161152