Search a number
-
+
146695025937 = 3330491479571
BaseRepresentation
bin1000100010011110110…
…1000111010100010001
3112000122102120102202210
42020213231013110101
54400412411312222
6151220223302333
713412145101235
oct2104755072421
9460572512683
10146695025937
1157238577229
122451ba4a9a9
1310aaa9480c5
14715887c5c5
153c38897d0c
hex2227b47511

146695025937 has 8 divisors (see below), whose sum is σ = 195599418400. Its totient is φ = 97793658720.

The previous prime is 146695025929. The next prime is 146695025963. The reversal of 146695025937 is 739520596641.

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

It is not a de Polignac number, because 146695025937 - 23 = 146695025929 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (146695025137) by changing a digit.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 640639 + ... + 838932.

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

Almost surely, 2146695025937 is an apocalyptic number.

It is an amenable number.

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

146695025937 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1512623.

The product of its (nonzero) digits is 12247200, while the sum is 57.

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

Divisors: 1 3 33049 99147 1479571 4438713 48898341979 146695025937