Search a number
-
+
146201141135 = 5710739039023
BaseRepresentation
bin1000100000101001000…
…1000101111110001111
3111222101000020111012002
42020022101011332033
54343404443004020
6151055221502515
713364000123660
oct2101221057617
9458330214162
10146201141135
1157004807275
1224402571a3b
1310a2c52458a
14710d039367
153c0a33b975
hex220a445f8f

146201141135 has 16 divisors (see below), whose sum is σ = 202378300416. Its totient is φ = 99315271968.

The previous prime is 146201141089. The next prime is 146201141143. The reversal of 146201141135 is 531141102641.

It is a cyclic number.

It is not a de Polignac number, because 146201141135 - 220 = 146200092559 is a prime.

It is a Duffinian number.

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

It is a congruent number.

It is an unprimeable number.

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 15 ways as a sum of consecutive naturals, for example, 19515767 + ... + 19523256.

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

Almost surely, 2146201141135 is an apocalyptic number.

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

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

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

The sum of its prime factors is 39039142.

The product of its (nonzero) digits is 2880, while the sum is 29.

Adding to 146201141135 its reverse (531141102641), we get a palindrome (677342243776).

The spelling of 146201141135 in words is "one hundred forty-six billion, two hundred one million, one hundred forty-one thousand, one hundred thirty-five".

Divisors: 1 5 7 35 107 535 749 3745 39039023 195195115 273273161 1366365805 4177175461 20885877305 29240228227 146201141135