Base | Representation |
---|---|
bin | 101111001000000001… |
… | …1100100000101010011 |
3 | 100200012212201121021002 |
4 | 1132100003210011103 |
5 | 3124224440214024 |
6 | 114254030452215 |
7 | 10211600111045 |
oct | 1362003440523 |
9 | 320185647232 |
10 | 101201101139 |
11 | 39a12424176 |
12 | 1774406406b |
13 | 970a5cb188 |
14 | 4c80799a95 |
15 | 29748e16ae |
hex | 17900e4153 |
101201101139 has 2 divisors, whose sum is σ = 101201101140. Its totient is φ = 101201101138.
The previous prime is 101201101051. The next prime is 101201101151. The reversal of 101201101139 is 931101102101.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101201101139 - 232 = 96906133843 is a prime.
It is a super-2 number, since 2×1012011011392 (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 101201101139.
It is not a weakly prime, because it can be changed into another prime (101201131139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50600550569 + 50600550570.
It is an arithmetic number, because the mean of its divisors is an integer number (50600550570).
Almost surely, 2101201101139 is an apocalyptic number.
101201101139 is a deficient number, since it is larger than the sum of its proper divisors (1).
101201101139 is an equidigital number, since it uses as much as digits as its factorization.
101201101139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 20.
The spelling of 101201101139 in words is "one hundred one billion, two hundred one million, one hundred one thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •