Base | Representation |
---|---|
bin | 101111001001111000… |
… | …1101110111111110001 |
3 | 100200101020012121221112 |
4 | 1132103301232333301 |
5 | 3124341431123423 |
6 | 114304141003105 |
7 | 10213255566155 |
oct | 1362361567761 |
9 | 320336177845 |
10 | 101263536113 |
11 | 39a44698523 |
12 | 17760b53495 |
13 | 971a51b54c |
14 | 4c88bad065 |
15 | 297a125a78 |
hex | 1793c6eff1 |
101263536113 has 2 divisors, whose sum is σ = 101263536114. Its totient is φ = 101263536112.
The previous prime is 101263536091. The next prime is 101263536137. The reversal of 101263536113 is 311635362101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 73001555344 + 28261980769 = 270188^2 + 168113^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101263536113 is a prime.
It is a super-2 number, since 2×1012635361132 (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 101263536113.
It is not a weakly prime, because it can be changed into another prime (101263536193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50631768056 + 50631768057.
It is an arithmetic number, because the mean of its divisors is an integer number (50631768057).
Almost surely, 2101263536113 is an apocalyptic number.
It is an amenable number.
101263536113 is a deficient number, since it is larger than the sum of its proper divisors (1).
101263536113 is an equidigital number, since it uses as much as digits as its factorization.
101263536113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9720, while the sum is 32.
Adding to 101263536113 its reverse (311635362101), we get a palindrome (412898898214).
The spelling of 101263536113 in words is "one hundred one billion, two hundred sixty-three million, five hundred thirty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •