Search a number
-
+
146911513 = 720987359
BaseRepresentation
bin10001100000110…
…11000100011001
3101020102212201011
420300123010121
5300102132023
622324453521
73432504310
oct1060330431
9336385634
10146911513
1175a22881
124124a2a1
132458a1b8
1415723277
15cd6e50d
hex8c1b119

146911513 has 4 divisors (see below), whose sum is σ = 167898880. Its totient is φ = 125924148.

The previous prime is 146911507. The next prime is 146911517. The reversal of 146911513 is 315119641.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 146911513 - 29 = 146911001 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (146911517) 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 in 3 ways as a sum of consecutive naturals, for example, 10493673 + ... + 10493686.

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

Almost surely, 2146911513 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 20987366.

The product of its digits is 3240, while the sum is 31.

The square root of 146911513 is about 12120.7059612879. The cubic root of 146911513 is about 527.6572914285.

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

Divisors: 1 7 20987359 146911513