Base | Representation |
---|---|
bin | 11111101100001011001110… |
… | …111110001010010001011011 |
3 | 200021111010122121201111201200 |
4 | 133230023032332022101123 |
5 | 121232010312224003244 |
6 | 1212232022022045243 |
7 | 41233344264534216 |
oct | 3754131676122133 |
9 | 607433577644650 |
10 | 139375161156699 |
11 | 40455745a74086 |
12 | 1376ba0b579823 |
13 | 5ca0037a53aa0 |
14 | 265bb1825077d |
15 | 111a703bd1669 |
hex | 7ec2cef8a45b |
139375161156699 has 24 divisors (see below), whose sum is σ = 228216638154960. Its totient is φ = 81255154681152.
The previous prime is 139375161156659. The next prime is 139375161156719. The reversal of 139375161156699 is 996651161573931.
139375161156699 is a `hidden beast` number, since 1 + 3 + 9 + 3 + 7 + 51 + 6 + 1 + 1 + 566 + 9 + 9 = 666.
It is not a de Polignac number, because 139375161156699 - 237 = 139237722203227 is a prime.
It is not an unprimeable number, because it can be changed into a prime (139375161156629) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 31348437084 + ... + 31348441529.
It is an arithmetic number, because the mean of its divisors is an integer number (9509026589790).
Almost surely, 2139375161156699 is an apocalyptic number.
139375161156699 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
139375161156699 is a deficient number, since it is larger than the sum of its proper divisors (88841476998261).
139375161156699 is a wasteful number, since it uses less digits than its factorization.
139375161156699 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62696878651 (or 62696878648 counting only the distinct ones).
The product of its digits is 248005800, while the sum is 72.
The spelling of 139375161156699 in words is "one hundred thirty-nine trillion, three hundred seventy-five billion, one hundred sixty-one million, one hundred fifty-six thousand, six hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •