Search a number
-
+
138251027695 = 5113037827677
BaseRepresentation
bin1000000011000001100…
…1110100010011101111
3111012211221200212210011
42000300121310103233
54231114230341240
6143302303154051
712662663226454
oct2006031642357
9435757625704
10138251027695
11536a5112390
1222963ba5927
131006342a041
14699723982b
1538e23e76ea
hex20306744ef

138251027695 has 16 divisors (see below), whose sum is σ = 181042975008. Its totient is φ = 100512973440.

The previous prime is 138251027659. The next prime is 138251027699. The reversal of 138251027695 is 596720152831.

It is not a de Polignac number, because 138251027695 - 29 = 138251027183 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (138251027699) 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 15 ways as a sum of consecutive naturals, for example, 246804 + ... + 580873.

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

Almost surely, 2138251027695 is an apocalyptic number.

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

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

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

The sum of its prime factors is 830730.

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

The spelling of 138251027695 in words is "one hundred thirty-eight billion, two hundred fifty-one million, twenty-seven thousand, six hundred ninety-five".

Divisors: 1 5 11 55 3037 15185 33407 167035 827677 4138385 9104447 45522235 2513655049 12568275245 27650205539 138251027695