Base | Representation |
---|---|
bin | 1101011100100011011… |
… | …1000000110101001011 |
3 | 211002021000010221012100 |
4 | 3113020313000311023 |
5 | 12241043300144321 |
6 | 254042114444443 |
7 | 22455321134436 |
oct | 3271067006513 |
9 | 732230127170 |
10 | 231003131211 |
11 | 89a71277596 |
12 | 3892a593723 |
13 | 18a25479728 |
14 | b27585081d |
15 | 602019c326 |
hex | 35c8dc0d4b |
231003131211 has 96 divisors (see below), whose sum is σ = 361776070656. Its totient is φ = 141523200000.
The previous prime is 231003131173. The next prime is 231003131213. The reversal of 231003131211 is 112131300132.
231003131211 is a `hidden beast` number, since 2 + 310 + 0 + 31 + 312 + 11 = 666.
231003131211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 231003131211 - 27 = 231003131083 is a prime.
It is not an unprimeable number, because it can be changed into a prime (231003131213) 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 95 ways as a sum of consecutive naturals, for example, 384364311 + ... + 384364911.
It is an arithmetic number, because the mean of its divisors is an integer number (3768500736).
Almost surely, 2231003131211 is an apocalyptic number.
231003131211 is a deficient number, since it is larger than the sum of its proper divisors (130772939445).
231003131211 is a wasteful number, since it uses less digits than its factorization.
231003131211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1033 (or 1030 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 231003131211 its reverse (112131300132), we get a palindrome (343134431343).
The spelling of 231003131211 in words is "two hundred thirty-one billion, three million, one hundred thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •