Base | Representation |
---|---|
bin | 10111000010011001111001… |
… | …101100001010001111011101 |
3 | 111021202010110022120122101121 |
4 | 113002121321230022033131 |
5 | 101240013003423211221 |
6 | 555253525033210541 |
7 | 30225102662116312 |
oct | 2702317154121735 |
9 | 437663408518347 |
10 | 101320320132061 |
11 | 2a313785332338 |
12 | b444682260a51 |
13 | 446c608044364 |
14 | 1b03d02db6d09 |
15 | baa8925e9a41 |
hex | 5c2679b0a3dd |
101320320132061 has 2 divisors, whose sum is σ = 101320320132062. Its totient is φ = 101320320132060.
The previous prime is 101320320131951. The next prime is 101320320132067. The reversal of 101320320132061 is 160231023023101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100131142968025 + 1189177164036 = 10006555^2 + 1090494^2 .
It is a cyclic number.
It is not a de Polignac number, because 101320320132061 - 217 = 101320320000989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101320320132067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50660160066030 + 50660160066031.
It is an arithmetic number, because the mean of its divisors is an integer number (50660160066031).
Almost surely, 2101320320132061 is an apocalyptic number.
It is an amenable number.
101320320132061 is a deficient number, since it is larger than the sum of its proper divisors (1).
101320320132061 is an equidigital number, since it uses as much as digits as its factorization.
101320320132061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 101320320132061 its reverse (160231023023101), we get a palindrome (261551343155162).
The spelling of 101320320132061 in words is "one hundred one trillion, three hundred twenty billion, three hundred twenty million, one hundred thirty-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •