Base | Representation |
---|---|
bin | 110100100011001111011110… |
… | …000110001010010011110101 |
3 | 1010022022212122220120010110111 |
4 | 310203033132012022103311 |
5 | 220243133143044301401 |
6 | 2135315054225023021 |
7 | 66452612202106633 |
oct | 6443173606122365 |
9 | 1108285586503414 |
10 | 231120211322101 |
11 | 67707592aaa882 |
12 | 21b0878b184a71 |
13 | 9bc67088a088a |
14 | 41103c684c353 |
15 | 1babe78dc8e51 |
hex | d233de18a4f5 |
231120211322101 has 2 divisors, whose sum is σ = 231120211322102. Its totient is φ = 231120211322100.
The previous prime is 231120211322023. The next prime is 231120211322113. The reversal of 231120211322101 is 101223112021132.
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., 172832697162225 + 58287514159876 = 13146585^2 + 7634626^2 .
It is a cyclic number.
It is not a de Polignac number, because 231120211322101 - 29 = 231120211321589 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231120211322131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115560105661050 + 115560105661051.
It is an arithmetic number, because the mean of its divisors is an integer number (115560105661051).
Almost surely, 2231120211322101 is an apocalyptic number.
It is an amenable number.
231120211322101 is a deficient number, since it is larger than the sum of its proper divisors (1).
231120211322101 is an equidigital number, since it uses as much as digits as its factorization.
231120211322101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 231120211322101 its reverse (101223112021132), we get a palindrome (332343323343233).
The spelling of 231120211322101 in words is "two hundred thirty-one trillion, one hundred twenty billion, two hundred eleven million, three hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •