Search a number
-
+
146555641 is a prime number
BaseRepresentation
bin10001011110001…
…00001011111001
3101012202210112201
420233010023321
5300004240031
622313110201
73426462631
oct1057041371
9335683481
10146555641
11757aa471
12410b8361
132449421b
141566d6c1
15ccedd61
hex8bc42f9

146555641 has 2 divisors, whose sum is σ = 146555642. Its totient is φ = 146555640.

The previous prime is 146555627. The next prime is 146555659.

146555641 is nontrivially palindromic in base 10.

146555641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 86415616 + 60140025 = 9296^2 + 7755^2 .

It is a palprime.

It is a cyclic number.

It is not a de Polignac number, because 146555641 - 225 = 113001209 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 146555641.

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

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

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

Almost surely, 2146555641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 72000, while the sum is 37.

The square root of 146555641 is about 12106.0167272311. The cubic root of 146555641 is about 527.2308889901.

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