Base | Representation |
---|---|
bin | 10111000010011010101000… |
… | …110110001110111110001111 |
3 | 111021202012111110022020120002 |
4 | 113002122220312032332033 |
5 | 101240021113443131111 |
6 | 555254135334514515 |
7 | 30225131410005305 |
oct | 2702325066167617 |
9 | 437665443266502 |
10 | 101321111302031 |
11 | 2a314050992015 |
12 | b444863205a3b |
13 | 446c702c2507a |
14 | 1b03d7a0c4275 |
15 | baa8dbcca63b |
hex | 5c26a8d8ef8f |
101321111302031 has 2 divisors, whose sum is σ = 101321111302032. Its totient is φ = 101321111302030.
The previous prime is 101321111301929. The next prime is 101321111302093. The reversal of 101321111302031 is 130203111123101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101321111302031 - 230 = 101320037560207 is a prime.
It is a super-2 number, since 2×1013211113020312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101321111301994 and 101321111302012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101321111302231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50660555651015 + 50660555651016.
It is an arithmetic number, because the mean of its divisors is an integer number (50660555651016).
Almost surely, 2101321111302031 is an apocalyptic number.
101321111302031 is a deficient number, since it is larger than the sum of its proper divisors (1).
101321111302031 is an equidigital number, since it uses as much as digits as its factorization.
101321111302031 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 20.
Adding to 101321111302031 its reverse (130203111123101), we get a palindrome (231524222425132).
The spelling of 101321111302031 in words is "one hundred one trillion, three hundred twenty-one billion, one hundred eleven million, three hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •