Base | Representation |
---|---|
bin | 10111000010000111000110… |
… | …011001000011001110010001 |
3 | 111021200012100101021222011121 |
4 | 113002013012121003032101 |
5 | 101234200132311203404 |
6 | 555240345510242241 |
7 | 30223456465003426 |
oct | 2702070631031621 |
9 | 437605311258147 |
10 | 101300132131729 |
11 | 2a306165776943 |
12 | b440789356381 |
13 | 446a73b72422b |
14 | 1b02d49b53d4d |
15 | baa0b00e4e54 |
hex | 5c21c6643391 |
101300132131729 has 2 divisors, whose sum is σ = 101300132131730. Its totient is φ = 101300132131728.
The previous prime is 101300132131727. The next prime is 101300132131753. The reversal of 101300132131729 is 927131231003101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 54006728051329 + 47293404080400 = 7348927^2 + 6877020^2 .
It is a cyclic number.
It is not a de Polignac number, because 101300132131729 - 21 = 101300132131727 is a prime.
Together with 101300132131727, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 101300132131694 and 101300132131703.
It is not a weakly prime, because it can be changed into another prime (101300132131727) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50650066065864 + 50650066065865.
It is an arithmetic number, because the mean of its divisors is an integer number (50650066065865).
Almost surely, 2101300132131729 is an apocalyptic number.
It is an amenable number.
101300132131729 is a deficient number, since it is larger than the sum of its proper divisors (1).
101300132131729 is an equidigital number, since it uses as much as digits as its factorization.
101300132131729 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6804, while the sum is 34.
The spelling of 101300132131729 in words is "one hundred one trillion, three hundred billion, one hundred thirty-two million, one hundred thirty-one thousand, seven hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •