Search a number
-
+
46526141 is a prime number
BaseRepresentation
bin1011000101111…
…0111010111101
310020112202212102
42301132322331
543402314031
64341114445
71103315504
oct261367275
9106482772
1046526141
1124298862
12136b8a25
13984017c
14627183b
1541407cb
hex2c5eebd

46526141 has 2 divisors, whose sum is σ = 46526142. Its totient is φ = 46526140.

The previous prime is 46526111. The next prime is 46526143. The reversal of 46526141 is 14162564.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 46526041 + 100 = 6821^2 + 10^2 .

It is a cyclic number.

It is not a de Polignac number, because 46526141 - 222 = 42331837 is a prime.

Together with 46526143, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 246526141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 5760, while the sum is 29.

The square root of 46526141 is about 6821.0073302995. The cubic root of 46526141 is about 359.6656901575.

The spelling of 46526141 in words is "forty-six million, five hundred twenty-six thousand, one hundred forty-one".