Search a number
-
+
146900537 = 731676961
BaseRepresentation
bin10001100000110…
…00011000111001
3101020102022122122
420300120120321
5300101304122
622324331025
73432430310
oct1060303071
9336368578
10146900537
1175a15603
1241243a75
13245851c4
141571d277
15cd6b142
hex8c18639

146900537 has 8 divisors (see below), whose sum is σ = 173302272. Its totient is φ = 121852800.

The previous prime is 146900497. The next prime is 146900549. The reversal of 146900537 is 735009641.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 146900537 - 26 = 146900473 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 146900497 and 146900506.

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

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

Almost surely, 2146900537 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 676999.

The product of its (nonzero) digits is 22680, while the sum is 35.

The square root of 146900537 is about 12120.2531739234. The cubic root of 146900537 is about 527.6441503874.

The spelling of 146900537 in words is "one hundred forty-six million, nine hundred thousand, five hundred thirty-seven".

Divisors: 1 7 31 217 676961 4738727 20985791 146900537