Search a number
-
+
139130392558 = 299170196969
BaseRepresentation
bin1000000110010011010…
…0010100111111101110
3111022010020101020121011
42001210310110333232
54234414340030213
6143525435055434
713023531552433
oct2014464247756
9438106336534
10139130392558
1154006530203
1222b6a5a157a
131017367a191
146a3bd43b8a
1539446ea03d
hex2064d14fee

139130392558 has 8 divisors (see below), whose sum is σ = 208906182720. Its totient is φ = 69494998320.

The previous prime is 139130392553. The next prime is 139130392567. The reversal of 139130392558 is 855293031931.

139130392558 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 super-2 number, since 2×1391303925582 (a number of 23 digits) contains 22 as substring.

It is a congruent number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35096503 + ... + 35100466.

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

Almost surely, 2139130392558 is an apocalyptic number.

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

139130392558 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 70197962.

The product of its (nonzero) digits is 874800, while the sum is 49.

The spelling of 139130392558 in words is "one hundred thirty-nine billion, one hundred thirty million, three hundred ninety-two thousand, five hundred fifty-eight".

Divisors: 1 2 991 1982 70196969 140393938 69565196279 139130392558