Search a number
-
+
139086054951 = 3288716058891
BaseRepresentation
bin1000000110001000101…
…1001100011000100111
3111022000010221122211120
42001202023030120213
54234322012224301
6143521212505023
713022452650324
oct2014213143047
9438003848746
10139086054951
1153a934a7758
1222b5777b173
13101674251cc
146a360c1b4b
15394088ce36
hex20622cc627

139086054951 has 8 divisors (see below), whose sum is σ = 185512320384. Its totient is φ = 92691913080.

The previous prime is 139086054941. The next prime is 139086054967. The reversal of 139086054951 is 159450680931.

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

It is not a de Polignac number, because 139086054951 - 221 = 139083957799 is a prime.

It is a super-2 number, since 2×1390860549512 (a number of 23 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 139086054894 and 139086054903.

It is a congruent number.

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

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

Almost surely, 2139086054951 is an apocalyptic number.

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

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

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

The sum of its prime factors is 16061781.

The product of its (nonzero) digits is 1166400, while the sum is 51.

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

Divisors: 1 3 2887 8661 16058891 48176673 46362018317 139086054951