Base | Representation |
---|---|
bin | 1101011100111101000… |
… | …0101001010101100001 |
3 | 211002112111012112201022 |
4 | 3113033100221111201 |
5 | 12241303242422032 |
6 | 254100512215225 |
7 | 22461063646025 |
oct | 3271720512541 |
9 | 732474175638 |
10 | 231110514017 |
11 | 8a016950909 |
12 | 3895a53a515 |
13 | 18a417a6756 |
14 | b285c04385 |
15 | 602980e512 |
hex | 35cf429561 |
231110514017 has 2 divisors, whose sum is σ = 231110514018. Its totient is φ = 231110514016.
The previous prime is 231110513987. The next prime is 231110514067. The reversal of 231110514017 is 710415011132.
231110514017 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., 155867829601 + 75242684416 = 394801^2 + 274304^2 .
It is a cyclic number.
It is not a de Polignac number, because 231110514017 - 220 = 231109465441 is a prime.
It is not a weakly prime, because it can be changed into another prime (231110514067) 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, 115555257008 + 115555257009.
It is an arithmetic number, because the mean of its divisors is an integer number (115555257009).
Almost surely, 2231110514017 is an apocalyptic number.
It is an amenable number.
231110514017 is a deficient number, since it is larger than the sum of its proper divisors (1).
231110514017 is an equidigital number, since it uses as much as digits as its factorization.
231110514017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840, while the sum is 26.
Adding to 231110514017 its reverse (710415011132), we get a palindrome (941525525149).
The spelling of 231110514017 in words is "two hundred thirty-one billion, one hundred ten million, five hundred fourteen thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •