Search a number
BaseRepresentation
bin101001110001…
…101100011101
3202121101120101
4221301230131
510300421303
61030421101
7162041302
oct51615435
922541511
1010951453
1161aaa97
123801791
132365966
1416510a9
15e64d1d
hexa71b1d

10951453 has 2 divisors, whose sum is σ = 10951454. Its totient is φ = 10951452.

The previous prime is 10951439. The next prime is 10951459. The reversal of 10951453 is 35415901.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9467929 + 1483524 = 3077^2 + 1218^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10951453 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (10951459) 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 as a sum of consecutive naturals, namely, 5475726 + 5475727.

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

Almost surely, 210951453 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2700, while the sum is 28.

The square root of 10951453 is about 3309.2979618040. The cubic root of 10951453 is about 222.0703521314.

The spelling of 10951453 in words is "ten million, nine hundred fifty-one thousand, four hundred fifty-three".