Base | Representation |
---|---|
bin | 1000000101111011011… |
… | …0010110110010100011 |
3 | 111021212020222000210012 |
4 | 2001132312112302203 |
5 | 4234213221322044 |
6 | 143511500555135 |
7 | 13021204501415 |
oct | 2013666266243 |
9 | 437766860705 |
10 | 139030260899 |
11 | 53a64a59872 |
12 | 22b40b52aab |
13 | 101589bb78a |
14 | 6a2c91a9b5 |
15 | 393aa1b59e |
hex | 205ed96ca3 |
139030260899 has 2 divisors, whose sum is σ = 139030260900. Its totient is φ = 139030260898.
The previous prime is 139030260877. The next prime is 139030260917. The reversal of 139030260899 is 998062030931.
139030260899 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 139030260899 - 216 = 139030195363 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (139030260799) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69515130449 + 69515130450.
It is an arithmetic number, because the mean of its divisors is an integer number (69515130450).
Almost surely, 2139030260899 is an apocalyptic number.
139030260899 is a deficient number, since it is larger than the sum of its proper divisors (1).
139030260899 is an equidigital number, since it uses as much as digits as its factorization.
139030260899 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 629856, while the sum is 50.
The spelling of 139030260899 in words is "one hundred thirty-nine billion, thirty million, two hundred sixty thousand, eight hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •