Base | Representation |
---|---|
bin | 1000000111001001110… |
… | …0100110111010101011 |
3 | 111022201011122112020011 |
4 | 2001302130212322223 |
5 | 4240401404234111 |
6 | 144004244112351 |
7 | 13032306266353 |
oct | 2016234467253 |
9 | 438634575204 |
10 | 139359055531 |
11 | 54113610073 |
12 | 230130956b7 |
13 | 101abb5ba07 |
14 | 6a60467b63 |
15 | 3959817021 |
hex | 2072726eab |
139359055531 has 2 divisors, whose sum is σ = 139359055532. Its totient is φ = 139359055530.
The previous prime is 139359055399. The next prime is 139359055609. The reversal of 139359055531 is 135550953931.
It is a happy number.
139359055531 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 139359055531 - 221 = 139356958379 is a prime.
It is a super-2 number, since 2×1393590555312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (139359052531) 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, 69679527765 + 69679527766.
It is an arithmetic number, because the mean of its divisors is an integer number (69679527766).
Almost surely, 2139359055531 is an apocalyptic number.
139359055531 is a deficient number, since it is larger than the sum of its proper divisors (1).
139359055531 is an equidigital number, since it uses as much as digits as its factorization.
139359055531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1366875, while the sum is 49.
The spelling of 139359055531 in words is "one hundred thirty-nine billion, three hundred fifty-nine million, fifty-five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •