[go: up one dir, main page]

Search a number
-
+
116953477 is a prime number
BaseRepresentation
bin1101111100010…
…01000110000101
322011001212000021
412332021012011
5214420002402
615334415141
72620042144
oct676110605
9264055007
10116953477
1160020973
12332014b1
131b2cb354
141176575b
15a402d37
hex6f89185

116953477 has 2 divisors, whose sum is σ = 116953478. Its totient is φ = 116953476.

The previous prime is 116953471. The next prime is 116953481. The reversal of 116953477 is 774359611.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 109286116 + 7667361 = 10454^2 + 2769^2 .

It is a cyclic number.

It is not a de Polignac number, because 116953477 - 23 = 116953469 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (116953471) 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, 58476738 + 58476739.

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

Almost surely, 2116953477 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 158760, while the sum is 43.

The square root of 116953477 is about 10814.5030861339. The cubic root of 116953477 is about 489.0324890627.

It can be divided in two parts, 1169534 and 77, that added together give a palindrome (1169611).

The spelling of 116953477 in words is "one hundred sixteen million, nine hundred fifty-three thousand, four hundred seventy-seven".