Base | Representation |
---|---|
bin | 10111000010011010110100… |
… | …001001110101100010111101 |
3 | 111021202012222200020101201122 |
4 | 113002122310021311202331 |
5 | 101240022011023141031 |
6 | 555254210232320325 |
7 | 30225136202224001 |
oct | 2702326411654275 |
9 | 437665880211648 |
10 | 101321300990141 |
11 | 2a314138a71551 |
12 | b4448b68430a5 |
13 | 446c73330b85b |
14 | 1b03d97380701 |
15 | baa8ed79947b |
hex | 5c26b42758bd |
101321300990141 has 2 divisors, whose sum is σ = 101321300990142. Its totient is φ = 101321300990140.
The previous prime is 101321300990087. The next prime is 101321300990227. The reversal of 101321300990141 is 141099003123101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 61239170198116 + 40082130792025 = 7825546^2 + 6331045^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101321300990141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101321300990341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50660650495070 + 50660650495071.
It is an arithmetic number, because the mean of its divisors is an integer number (50660650495071).
Almost surely, 2101321300990141 is an apocalyptic number.
It is an amenable number.
101321300990141 is a deficient number, since it is larger than the sum of its proper divisors (1).
101321300990141 is an equidigital number, since it uses as much as digits as its factorization.
101321300990141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832, while the sum is 35.
The spelling of 101321300990141 in words is "one hundred one trillion, three hundred twenty-one billion, three hundred million, nine hundred ninety thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •