Base | Representation |
---|---|
bin | 1101011101000100000… |
… | …1010010000110011101 |
3 | 211002121112202200021121 |
4 | 3113101001102012131 |
5 | 12241333322303432 |
6 | 254103445130541 |
7 | 22461602634616 |
oct | 3272101220635 |
9 | 732545680247 |
10 | 231140041117 |
11 | 8a031588a77 |
12 | 389683b9a51 |
13 | 18a479443cb |
14 | b289accc0d |
15 | 602c1e3197 |
hex | 35d105219d |
231140041117 has 2 divisors, whose sum is σ = 231140041118. Its totient is φ = 231140041116.
The previous prime is 231140041091. The next prime is 231140041147. The reversal of 231140041117 is 711140041132.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 186238854916 + 44901186201 = 431554^2 + 211899^2 .
It is a cyclic number.
It is not a de Polignac number, because 231140041117 - 211 = 231140039069 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 231140041091 and 231140041100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231140041147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115570020558 + 115570020559.
It is an arithmetic number, because the mean of its divisors is an integer number (115570020559).
Almost surely, 2231140041117 is an apocalyptic number.
It is an amenable number.
231140041117 is a deficient number, since it is larger than the sum of its proper divisors (1).
231140041117 is an equidigital number, since it uses as much as digits as its factorization.
231140041117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 25.
Adding to 231140041117 its reverse (711140041132), we get a palindrome (942280082249).
The spelling of 231140041117 in words is "two hundred thirty-one billion, one hundred forty million, forty-one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •