Base | Representation |
---|---|
bin | 10111000010010010001011… |
… | …101011011100101111111101 |
3 | 111021201100001200222222000022 |
4 | 113002102023223130233331 |
5 | 101234344020143013041 |
6 | 555250034401541525 |
7 | 30224360412142052 |
oct | 2702221353345775 |
9 | 437640050888008 |
10 | 101312032001021 |
11 | 2a310211957866 |
12 | b442b4a6448a5 |
13 | 446b8b6bca8ca |
14 | 1b03758349029 |
15 | baa559b8724b |
hex | 5c248badcbfd |
101312032001021 has 2 divisors, whose sum is σ = 101312032001022. Its totient is φ = 101312032001020.
The previous prime is 101312032000987. The next prime is 101312032001069. The reversal of 101312032001021 is 120100230213101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 79956413167225 + 21355618833796 = 8941835^2 + 4621214^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101312032001021 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 (101312032004021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50656016000510 + 50656016000511.
It is an arithmetic number, because the mean of its divisors is an integer number (50656016000511).
Almost surely, 2101312032001021 is an apocalyptic number.
It is an amenable number.
101312032001021 is a deficient number, since it is larger than the sum of its proper divisors (1).
101312032001021 is an equidigital number, since it uses as much as digits as its factorization.
101312032001021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 101312032001021 its reverse (120100230213101), we get a palindrome (221412262214122).
The spelling of 101312032001021 in words is "one hundred one trillion, three hundred twelve billion, thirty-two million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •