Base | Representation |
---|---|
bin | 1101011101011100001… |
… | …0110111100100000001 |
3 | 211002212120222000102222 |
4 | 3113113002313210001 |
5 | 12242040211320001 |
6 | 254121455420425 |
7 | 22464241042343 |
oct | 3272702674401 |
9 | 732776860388 |
10 | 231241120001 |
11 | 8a083647041 |
12 | 38996224715 |
13 | 18a62874cb8 |
14 | b2992c1293 |
15 | 603600c61b |
hex | 35d70b7901 |
231241120001 has 2 divisors, whose sum is σ = 231241120002. Its totient is φ = 231241120000.
The previous prime is 231241119961. The next prime is 231241120007. The reversal of 231241120001 is 100021142132.
231241120001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 118972565776 + 112268554225 = 344924^2 + 335065^2 .
It is a cyclic number.
It is not a de Polignac number, because 231241120001 - 26 = 231241119937 is a prime.
It is not a weakly prime, because it can be changed into another prime (231241120007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115620560000 + 115620560001.
It is an arithmetic number, because the mean of its divisors is an integer number (115620560001).
Almost surely, 2231241120001 is an apocalyptic number.
It is an amenable number.
231241120001 is a deficient number, since it is larger than the sum of its proper divisors (1).
231241120001 is an equidigital number, since it uses as much as digits as its factorization.
231241120001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 231241120001 its reverse (100021142132), we get a palindrome (331262262133).
The spelling of 231241120001 in words is "two hundred thirty-one billion, two hundred forty-one million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •