[go: up one dir, main page]

Search a number
-
+
11164251 = 37531631
BaseRepresentation
bin101010100101…
…101001011011
3210000012110210
4222211221123
510324224001
61035142203
7163615560
oct52455133
923005423
1011164251
11633595a
1238a4963
13240b787
1416a8867
15ea7dd6
hexaa5a5b

11164251 has 8 divisors (see below), whose sum is σ = 17012224. Its totient is φ = 6379560.

The previous prime is 11164243. The next prime is 11164271. The reversal of 11164251 is 15246111.

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

It is not a de Polignac number, because 11164251 - 23 = 11164243 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 531631 = 11164251 / (1 + 1 + 1 + 6 + 4 + 2 + 5 + 1).

It is a Duffinian number.

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

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

Almost surely, 211164251 is an apocalyptic number.

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

11164251 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 531641.

The product of its digits is 240, while the sum is 21.

The square root of 11164251 is about 3341.2948089027. The cubic root of 11164251 is about 223.4994870089.

The spelling of 11164251 in words is "eleven million, one hundred sixty-four thousand, two hundred fifty-one".

Divisors: 1 3 7 21 531631 1594893 3721417 11164251