Base | Representation |
---|---|
bin | 1101011101101010100… |
… | …0001010111010000011 |
3 | 211010000210001221011001 |
4 | 3113122220022322003 |
5 | 12242201103331321 |
6 | 254131444032431 |
7 | 22465601005642 |
oct | 3273250127203 |
9 | 733023057131 |
10 | 231301230211 |
11 | 8a1045727a7 |
12 | 389b2392717 |
13 | 18a7216017c |
14 | b2a328b359 |
15 | 603b432c91 |
hex | 35daa0ae83 |
231301230211 has 8 divisors (see below), whose sum is σ = 236744133120. Its totient is φ = 225861227592.
The previous prime is 231301230191. The next prime is 231301230229. The reversal of 231301230211 is 112032103132.
231301230211 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 a cyclic number.
It is not a de Polignac number, because 231301230211 - 221 = 231299133059 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (231301030211) 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, 563275 + ... + 883108.
It is an arithmetic number, because the mean of its divisors is an integer number (29593016640).
Almost surely, 2231301230211 is an apocalyptic number.
231301230211 is a deficient number, since it is larger than the sum of its proper divisors (5442902909).
231301230211 is a wasteful number, since it uses less digits than its factorization.
231301230211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1450145.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 231301230211 its reverse (112032103132), we get a palindrome (343333333343).
The spelling of 231301230211 in words is "two hundred thirty-one billion, three hundred one million, two hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •