Search a number
-
+
46845077 is a prime number
BaseRepresentation
bin1011001010110…
…0110010010101
310021010222100212
42302230302111
543443020302
64352015205
71106114366
oct262546225
9107128325
1046845077
1124496444
1213831505
1399223a6
146315b6d
1541a5052
hex2cacc95

46845077 has 2 divisors, whose sum is σ = 46845078. Its totient is φ = 46845076.

The previous prime is 46845037. The next prime is 46845079. The reversal of 46845077 is 77054864.

46845077 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., 46799281 + 45796 = 6841^2 + 214^2 .

It is a cyclic number.

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

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

Together with 46845079, 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 (46845079) 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, 23422538 + 23422539.

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

Almost surely, 246845077 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 188160, while the sum is 41.

The square root of 46845077 is about 6844.3463530128. The cubic root of 46845077 is about 360.4856536965.

The spelling of 46845077 in words is "forty-six million, eight hundred forty-five thousand, seventy-seven".