Base | Representation |
---|---|
bin | 1101011101101101010… |
… | …1100001111111001111 |
3 | 211010001121110001120012 |
4 | 3113123111201333033 |
5 | 12242212124334411 |
6 | 254132550543435 |
7 | 22466104042433 |
oct | 3273325417717 |
9 | 733047401505 |
10 | 231313121231 |
11 | 8a110254695 |
12 | 389b6367b7b |
13 | 18a7476468a |
14 | b2a4aa49c3 |
15 | 603c4d118b |
hex | 35db561fcf |
231313121231 has 4 divisors (see below), whose sum is σ = 231319851000. Its totient is φ = 231306391464.
The previous prime is 231313121159. The next prime is 231313121309. The reversal of 231313121231 is 132121313132.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-231313121231 is a prime.
It is a super-2 number, since 2×2313131212312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 231313121197 and 231313121206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231313121131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3313061 + ... + 3382158.
It is an arithmetic number, because the mean of its divisors is an integer number (57829962750).
Almost surely, 2231313121231 is an apocalyptic number.
231313121231 is a deficient number, since it is larger than the sum of its proper divisors (6729769).
231313121231 is an equidigital number, since it uses as much as digits as its factorization.
231313121231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6729768.
The product of its digits is 648, while the sum is 23.
Adding to 231313121231 its reverse (132121313132), we get a palindrome (363434434363).
The spelling of 231313121231 in words is "two hundred thirty-one billion, three hundred thirteen million, one hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •