Base | Representation |
---|---|
bin | 101111001000000001… |
… | …1100100000011111011 |
3 | 100200012212201121010211 |
4 | 1132100003210003323 |
5 | 3124224440213201 |
6 | 114254030451551 |
7 | 10211600110561 |
oct | 1362003440373 |
9 | 320185647124 |
10 | 101201101051 |
11 | 39a124240a6 |
12 | 17744063bb7 |
13 | 970a5cb11b |
14 | 4c80799a31 |
15 | 29748e1651 |
hex | 17900e40fb |
101201101051 has 2 divisors, whose sum is σ = 101201101052. Its totient is φ = 101201101050.
The previous prime is 101201101013. The next prime is 101201101139. The reversal of 101201101051 is 150101102101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101201101051 - 223 = 101192712443 is a prime.
It is not a weakly prime, because it can be changed into another prime (101201101151) 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 as a sum of consecutive naturals, namely, 50600550525 + 50600550526.
It is an arithmetic number, because the mean of its divisors is an integer number (50600550526).
Almost surely, 2101201101051 is an apocalyptic number.
101201101051 is a deficient number, since it is larger than the sum of its proper divisors (1).
101201101051 is an equidigital number, since it uses as much as digits as its factorization.
101201101051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10, while the sum is 13.
Adding to 101201101051 its reverse (150101102101), we get a palindrome (251302203152).
The spelling of 101201101051 in words is "one hundred one billion, two hundred one million, one hundred one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •