Base | Representation |
---|---|
bin | 10111000010000111000110… |
… | …011001000011000111100101 |
3 | 111021200012100101021221120202 |
4 | 113002013012121003013211 |
5 | 101234200132311200201 |
6 | 555240345510240245 |
7 | 30223456465002245 |
oct | 2702070631030745 |
9 | 437605311257522 |
10 | 101300132131301 |
11 | 2a306165776594 |
12 | b440789356085 |
13 | 446a73b723c8c |
14 | 1b02d49b53b25 |
15 | baa0b00e4c6b |
hex | 5c21c66431e5 |
101300132131301 has 2 divisors, whose sum is σ = 101300132131302. Its totient is φ = 101300132131300.
The previous prime is 101300132131169. The next prime is 101300132131307. The reversal of 101300132131301 is 103131231003101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88985752767076 + 12314379364225 = 9433226^2 + 3509185^2 .
It is a cyclic number.
It is not a de Polignac number, because 101300132131301 - 246 = 30931387953637 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101300132131307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50650066065650 + 50650066065651.
It is an arithmetic number, because the mean of its divisors is an integer number (50650066065651).
Almost surely, 2101300132131301 is an apocalyptic number.
It is an amenable number.
101300132131301 is a deficient number, since it is larger than the sum of its proper divisors (1).
101300132131301 is an equidigital number, since it uses as much as digits as its factorization.
101300132131301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 101300132131301 its reverse (103131231003101), we get a palindrome (204431363134402).
The spelling of 101300132131301 in words is "one hundred one trillion, three hundred billion, one hundred thirty-two million, one hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •