Base | Representation |
---|---|
bin | 10110111110001100101110… |
… | …111000101100111110000001 |
3 | 111020201111110011120120022222 |
4 | 112332030232320230332001 |
5 | 101220244101343220001 |
6 | 554513050050340425 |
7 | 30165161566212404 |
oct | 2676145670547601 |
9 | 436644404516288 |
10 | 101031302320001 |
11 | 2a212153308419 |
12 | b3b866288a715 |
13 | 444b298544811 |
14 | 1ad3d26629d3b |
15 | ba30c915c61b |
hex | 5be32ee2cf81 |
101031302320001 has 2 divisors, whose sum is σ = 101031302320002. Its totient is φ = 101031302320000.
The previous prime is 101031302319989. The next prime is 101031302320031. The reversal of 101031302320001 is 100023203130101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 75180951783025 + 25850350536976 = 8670695^2 + 5084324^2 .
It is an emirp because it is prime and its reverse (100023203130101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101031302320001 is a prime.
It is not a weakly prime, because it can be changed into another prime (101031302320031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50515651160000 + 50515651160001.
It is an arithmetic number, because the mean of its divisors is an integer number (50515651160001).
Almost surely, 2101031302320001 is an apocalyptic number.
It is an amenable number.
101031302320001 is a deficient number, since it is larger than the sum of its proper divisors (1).
101031302320001 is an equidigital number, since it uses as much as digits as its factorization.
101031302320001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 101031302320001 its reverse (100023203130101), we get a palindrome (201054505450102).
The spelling of 101031302320001 in words is "one hundred one trillion, thirty-one billion, three hundred two million, three hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •