Base | Representation |
---|---|
bin | 1000000111111101010… |
… | …1011001101010001111 |
3 | 111100021020111100202121 |
4 | 2001333111121222033 |
5 | 4241322232120111 |
6 | 144041530233411 |
7 | 13040543135341 |
oct | 2017725315217 |
9 | 440236440677 |
10 | 139575270031 |
11 | 5421466823a |
12 | 23073585867 |
13 | 102148a23a2 |
14 | 6a8106b291 |
15 | 396d7c5871 |
hex | 207f559a8f |
139575270031 has 2 divisors, whose sum is σ = 139575270032. Its totient is φ = 139575270030.
The previous prime is 139575270013. The next prime is 139575270047. The reversal of 139575270031 is 130072575931.
Together with previous prime (139575270013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-139575270031 is a prime.
It is a super-2 number, since 2×1395752700312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 139575270031.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (139575270431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69787635015 + 69787635016.
It is an arithmetic number, because the mean of its divisors is an integer number (69787635016).
Almost surely, 2139575270031 is an apocalyptic number.
139575270031 is a deficient number, since it is larger than the sum of its proper divisors (1).
139575270031 is an equidigital number, since it uses as much as digits as its factorization.
139575270031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 198450, while the sum is 43.
The spelling of 139575270031 in words is "one hundred thirty-nine billion, five hundred seventy-five million, two hundred seventy thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •