Search a number
-
+
109465477 = 119951407
BaseRepresentation
bin1101000011001…
…00111110000101
321121222102101221
412201210332011
5211010343402
614510120341
72466304222
oct641447605
9247872357
10109465477
1156877040
12307b00b1
13198a8c94
1410776949
159924337
hex6864f85

109465477 has 4 divisors (see below), whose sum is σ = 119416896. Its totient is φ = 99514060.

The previous prime is 109465451. The next prime is 109465483. The reversal of 109465477 is 774564901.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (109465417) 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 3 ways as a sum of consecutive naturals, for example, 4975693 + ... + 4975714.

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

Almost surely, 2109465477 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 9951418.

The product of its (nonzero) digits is 211680, while the sum is 43.

The square root of 109465477 is about 10462.5750654416. The cubic root of 109465477 is about 478.3646269865.

The spelling of 109465477 in words is "one hundred nine million, four hundred sixty-five thousand, four hundred seventy-seven".

Divisors: 1 11 9951407 109465477