Search a number
-
+
139157684710 = 25112115006351
BaseRepresentation
bin1000000110011001110…
…0011100000111100110
3111022012010201211101121
42001212130130013212
54234443331402320
6143532252044154
713024312542412
oct2014634340746
9438163654347
10139157684710
115401a981200
1222b7776365a
1310179214795
146a41809d42
153946cdb8aa
hex206671c1e6

139157684710 has 24 divisors (see below), whose sum is σ = 275325206688. Its totient is φ = 50602794000.

The previous prime is 139157684671. The next prime is 139157684767. The reversal of 139157684710 is 17486751931.

It is a super-3 number, since 3×1391576847103 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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 11 ways as a sum of consecutive naturals, for example, 57501966 + ... + 57504385.

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

Almost surely, 2139157684710 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 115006380 (or 115006369 counting only the distinct ones).

The product of its (nonzero) digits is 1270080, while the sum is 52.

The spelling of 139157684710 in words is "one hundred thirty-nine billion, one hundred fifty-seven million, six hundred eighty-four thousand, seven hundred ten".

Divisors: 1 2 5 10 11 22 55 110 121 242 605 1210 115006351 230012702 575031755 1150063510 1265069861 2530139722 6325349305 12650698610 13915768471 27831536942 69578842355 139157684710