Search a number
-
+
10140555659 = 136711642429
BaseRepresentation
bin10010111000110110…
…01001100110001011
3222011201020121020112
421130123021212023
5131231440240114
64354123144535
7506202205133
oct113433114613
928151217215
1010140555659
114334096613
121b7007514b
13c57b606c0
146c2aadac3
153e53c413e
hex25c6c998b

10140555659 has 8 divisors (see below), whose sum is σ = 11083593360. Its totient is φ = 9220802976.

The previous prime is 10140555643. The next prime is 10140555661. The reversal of 10140555659 is 95655504101.

10140555659 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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 10140555659 - 24 = 10140555643 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (10140555619) 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, 5820344 + ... + 5822085.

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

Almost surely, 210140555659 is an apocalyptic number.

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

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

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

The sum of its prime factors is 11642509.

The product of its (nonzero) digits is 135000, while the sum is 41.

The spelling of 10140555659 in words is "ten billion, one hundred forty million, five hundred fifty-five thousand, six hundred fifty-nine".

Divisors: 1 13 67 871 11642429 151351577 780042743 10140555659