Base | Representation |
---|---|
bin | 1101011101010111011… |
… | …0100010011000011101 |
3 | 211002211012022102021222 |
4 | 3113111312202120131 |
5 | 12242020101012201 |
6 | 254115502503125 |
7 | 22463606003126 |
oct | 3272566423035 |
9 | 732735272258 |
10 | 231221110301 |
11 | 8a07331a4a5 |
12 | 3898b594aa5 |
13 | 18a5b68a33c |
14 | b29679304d |
15 | 60343a891b |
hex | 35d5da261d |
231221110301 has 2 divisors, whose sum is σ = 231221110302. Its totient is φ = 231221110300.
The previous prime is 231221110279. The next prime is 231221110303. The reversal of 231221110301 is 103011122132.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 227138028100 + 4083082201 = 476590^2 + 63899^2 .
It is a cyclic number.
It is not a de Polignac number, because 231221110301 - 210 = 231221109277 is a prime.
Together with 231221110303, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 231221110301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231221110303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115610555150 + 115610555151.
It is an arithmetic number, because the mean of its divisors is an integer number (115610555151).
Almost surely, 2231221110301 is an apocalyptic number.
It is an amenable number.
231221110301 is a deficient number, since it is larger than the sum of its proper divisors (1).
231221110301 is an equidigital number, since it uses as much as digits as its factorization.
231221110301 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 231221110301 its reverse (103011122132), we get a palindrome (334232232433).
The spelling of 231221110301 in words is "two hundred thirty-one billion, two hundred twenty-one million, one hundred ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •