Search a number
-
+
146905111 is a prime number
BaseRepresentation
bin10001100000110…
…01100000010111
3101020102112221001
420300121200113
5300101430421
622324404131
73432446533
oct1060314027
9336375831
10146905111
1175a18a91
1241246647
1324587302
1415720bc3
15cd6c691
hex8c19817

146905111 has 2 divisors, whose sum is σ = 146905112. Its totient is φ = 146905110.

The previous prime is 146905081. The next prime is 146905123. The reversal of 146905111 is 111509641.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 146905111 - 25 = 146905079 is a prime.

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

It is a Chen prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2146905111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1080, while the sum is 28.

The square root of 146905111 is about 12120.4418648826. The cubic root of 146905111 is about 527.6496266989.

The spelling of 146905111 in words is "one hundred forty-six million, nine hundred five thousand, one hundred eleven".