Base | Representation |
---|---|
bin | 1101011101110011110… |
… | …0110110000000001001 |
3 | 211010010111102000012020 |
4 | 3113130330312000021 |
5 | 12242241043012131 |
6 | 254135355235053 |
7 | 22466553201162 |
oct | 3273474660011 |
9 | 733114360166 |
10 | 231340204041 |
11 | 8a124572381 |
12 | 38a03448a89 |
13 | 18a7a2578cb |
14 | b2a8514769 |
15 | 603ea80996 |
hex | 35dcf36009 |
231340204041 has 8 divisors (see below), whose sum is σ = 315976864224. Its totient is φ = 150465173280.
The previous prime is 231340204001. The next prime is 231340204057. The reversal of 231340204041 is 140402043132.
231340204041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 231340204041 - 218 = 231339941897 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (231340204001) 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 in 7 ways as a sum of consecutive naturals, for example, 940407211 + ... + 940407456.
It is an arithmetic number, because the mean of its divisors is an integer number (39497108028).
Almost surely, 2231340204041 is an apocalyptic number.
It is an amenable number.
231340204041 is a deficient number, since it is larger than the sum of its proper divisors (84636660183).
231340204041 is a wasteful number, since it uses less digits than its factorization.
231340204041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1880814711.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 231340204041 its reverse (140402043132), we get a palindrome (371742247173).
The spelling of 231340204041 in words is "two hundred thirty-one billion, three hundred forty million, two hundred four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •