Search a number
11145469 is a prime number
BaseRepresentation
bin101010100001…
…000011111101
3202222020201011
4222201003331
510323123334
61034515221
7163510036
oct52410375
922866634
1011145469
116322835
123895b11
13240306a
1416a1a8d
15ea2564
hexaa10fd

11145469 has 2 divisors, whose sum is σ = 11145470. Its totient is φ = 11145468.

The previous prime is 11145443. The next prime is 11145487. The reversal of 11145469 is 96454111.

11145469 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8702500 + 2442969 = 2950^2 + 1563^2 .

It is a cyclic number.

It is not a de Polignac number, because 11145469 - 29 = 11144957 is a prime.

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

It is equal to p735475 and since 11145469 and 735475 have the same sum of digits, it is a Honaker prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (11145499) by changing a digit.

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

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

Almost surely, 211145469 is an apocalyptic number.

It is an amenable number.

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

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

11145469 is an evil number, because the sum of its binary digits is even.

The product of its digits is 4320, while the sum is 31.

The square root of 11145469 is about 3338.4830387468. The cubic root of 11145469 is about 223.3740830571.

The spelling of 11145469 in words is "eleven million, one hundred forty-five thousand, four hundred sixty-nine".