Search a number
-
+
140660101153 = 1113983637071
BaseRepresentation
bin1000001011111111111…
…1101101000000100001
3111110001211210111022001
42002333333231000201
54301032441214103
6144341322044001
713106455063315
oct2027777550041
9443054714261
10140660101153
1154720a61990
1223316949601
13103585718b0
146b4517bb45
1539d3b6201d
hex20bffed021

140660101153 has 8 divisors (see below), whose sum is σ = 165251028096. Its totient is φ = 118036448400.

The previous prime is 140660101151. The next prime is 140660101157. The reversal of 140660101153 is 351101066041.

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

It is not a de Polignac number, because 140660101153 - 21 = 140660101151 is a prime.

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

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

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

Almost surely, 2140660101153 is an apocalyptic number.

140660101153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.

It is an amenable number.

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

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

140660101153 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 983637095.

The product of its (nonzero) digits is 2160, while the sum is 28.

Adding to 140660101153 its reverse (351101066041), we get a palindrome (491761167194).

The spelling of 140660101153 in words is "one hundred forty billion, six hundred sixty million, one hundred one thousand, one hundred fifty-three".

Divisors: 1 11 13 143 983637071 10820007781 12787281923 140660101153