Search a number
-
+
146140926051 = 3313414146027
BaseRepresentation
bin1000100000011010101…
…1011001000001100011
3111222012210221020121210
42020012223121001203
54343244034113201
6151045231121203
713362336242541
oct2100653310143
9458183836553
10146140926051
1156a8381983a
12243a6373203
1310a1cc00753
147105042d91
153c04de51d6
hex2206ad9063

146140926051 has 16 divisors (see below), whose sum is σ = 201150460928. Its totient is φ = 94279658400.

The previous prime is 146140926049. The next prime is 146140926073. The reversal of 146140926051 is 150629041641.

It is not a de Polignac number, because 146140926051 - 21 = 146140926049 is a prime.

It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.

It is a Duffinian number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3152100 + ... + 3198126.

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

Almost surely, 2146140926051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 80202.

The product of its (nonzero) digits is 51840, while the sum is 39.

Adding to 146140926051 its reverse (150629041641), we get a palindrome (296769967692).

The spelling of 146140926051 in words is "one hundred forty-six billion, one hundred forty million, nine hundred twenty-six thousand, fifty-one".

Divisors: 1 3 31 93 34141 46027 102423 138081 1058371 1426837 3175113 4280511 1571407807 4714223421 48713642017 146140926051