Search a number
-
+
146515361 is a prime number
BaseRepresentation
bin10001011101110…
…10010110100001
3101012200202021212
420232322112201
5300001442421
622312155505
73426234326
oct1056722641
9335622255
10146515361
1175782183
1241098b95
132447baa5
141565cb4d
15cce1e5b
hex8bba5a1

146515361 has 2 divisors, whose sum is σ = 146515362. Its totient is φ = 146515360.

The previous prime is 146515357. The next prime is 146515363. The reversal of 146515361 is 163515641.

146515361 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., 133841761 + 12673600 = 11569^2 + 3560^2 .

It is a cyclic number.

It is not a de Polignac number, because 146515361 - 22 = 146515357 is a prime.

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a Curzon number.

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

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

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

Almost surely, 2146515361 is an apocalyptic number.

It is an amenable number.

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

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

146515361 is an evil number, because the sum of its binary digits is even.

The product of its digits is 10800, while the sum is 32.

The square root of 146515361 is about 12104.3529773384. The cubic root of 146515361 is about 527.1825824085.

The spelling of 146515361 in words is "one hundred forty-six million, five hundred fifteen thousand, three hundred sixty-one".