Base | Representation |
---|---|
bin | 10111000001000111001000… |
… | …010001001000000100000101 |
3 | 111021102122001101201001110101 |
4 | 113001013020101020010011 |
5 | 101232033444144211401 |
6 | 555145030004124101 |
7 | 30215505361434643 |
oct | 2701071021100405 |
9 | 437378041631411 |
10 | 101231444132101 |
11 | 2a28a0181290a8 |
12 | b42b3b9996631 |
13 | 4464113056a7a |
14 | 1add8b14a4193 |
15 | ba83dec95101 |
hex | 5c11c8448105 |
101231444132101 has 2 divisors, whose sum is σ = 101231444132102. Its totient is φ = 101231444132100.
The previous prime is 101231444132081. The next prime is 101231444132107.
101231444132101 is nontrivially palindromic in base 10.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97165377562500 + 4066066569601 = 9857250^2 + 2016449^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 101231444132101 - 217 = 101231444001029 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101231444132101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101231444132107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50615722066050 + 50615722066051.
It is an arithmetic number, because the mean of its divisors is an integer number (50615722066051).
Almost surely, 2101231444132101 is an apocalyptic number.
It is an amenable number.
101231444132101 is a deficient number, since it is larger than the sum of its proper divisors (1).
101231444132101 is an equidigital number, since it uses as much as digits as its factorization.
101231444132101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 28.
The spelling of 101231444132101 in words is "one hundred one trillion, two hundred thirty-one billion, four hundred forty-four million, one hundred thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •