Base | Representation |
---|---|
bin | 1000000111001011001… |
… | …0111000100101010011 |
3 | 111022201120122012112222 |
4 | 2001302302320211103 |
5 | 4240404403120214 |
6 | 144005013211255 |
7 | 13032410030255 |
oct | 2016262704523 |
9 | 438646565488 |
10 | 139364895059 |
11 | 54116939425 |
12 | 23015030b2b |
13 | 101b0124960 |
14 | 6a61147cd5 |
15 | 395a0bc38e |
hex | 2072cb8953 |
139364895059 has 8 divisors (see below), whose sum is σ = 150409436352. Its totient is φ = 128366663040.
The previous prime is 139364895041. The next prime is 139364895067. The reversal of 139364895059 is 950598463931.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-139364895059 is a prime.
It is a super-2 number, since 2×1393648950592 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 139364894992 and 139364895010.
It is not an unprimeable number, because it can be changed into a prime (139364895029) 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 7 ways as a sum of consecutive naturals, for example, 11571062 + ... + 11583099.
It is an arithmetic number, because the mean of its divisors is an integer number (18801179544).
Almost surely, 2139364895059 is an apocalyptic number.
139364895059 is a deficient number, since it is larger than the sum of its proper divisors (11044541293).
139364895059 is a wasteful number, since it uses less digits than its factorization.
139364895059 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23154637.
The product of its (nonzero) digits is 31492800, while the sum is 62.
The spelling of 139364895059 in words is "one hundred thirty-nine billion, three hundred sixty-four million, eight hundred ninety-five thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •