Base | Representation |
---|---|
bin | 100001111011001000001… |
… | …101010111100101010101 |
3 | 22020212022111211100021212 |
4 | 201323020031113211111 |
5 | 301143330143101401 |
6 | 4542541451351205 |
7 | 330266040303155 |
oct | 41731015274525 |
9 | 8225274740255 |
10 | 2331231222101 |
11 | 819740282541 |
12 | 317984752505 |
13 | 13baac861852 |
14 | 80b91776765 |
15 | 4099241bdbb |
hex | 21ec8357955 |
2331231222101 has 2 divisors, whose sum is σ = 2331231222102. Its totient is φ = 2331231222100.
The previous prime is 2331231222097. The next prime is 2331231222157. The reversal of 2331231222101 is 1012221321332.
2331231222101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2291060640625 + 40170581476 = 1513625^2 + 200426^2 .
It is a cyclic number.
It is not a de Polignac number, because 2331231222101 - 22 = 2331231222097 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2331231222181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1165615611050 + 1165615611051.
It is an arithmetic number, because the mean of its divisors is an integer number (1165615611051).
Almost surely, 22331231222101 is an apocalyptic number.
It is an amenable number.
2331231222101 is a deficient number, since it is larger than the sum of its proper divisors (1).
2331231222101 is an equidigital number, since it uses as much as digits as its factorization.
2331231222101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 2331231222101 its reverse (1012221321332), we get a palindrome (3343452543433).
The spelling of 2331231222101 in words is "two trillion, three hundred thirty-one billion, two hundred thirty-one million, two hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •