Base | Representation |
---|---|
bin | 1101011101101101001… |
… | …0001011001100000011 |
3 | 211010001112210100200021 |
4 | 3113123102023030003 |
5 | 12242211413211121 |
6 | 254132520034311 |
7 | 22466063416366 |
oct | 3273322131403 |
9 | 733045710607 |
10 | 231312241411 |
11 | 8a10a803669 |
12 | 389b6002997 |
13 | 18a74517084 |
14 | b2a49160dd |
15 | 603c3aa641 |
hex | 35db48b303 |
231312241411 has 4 divisors (see below), whose sum is σ = 231318372472. Its totient is φ = 231306110352.
The previous prime is 231312241343. The next prime is 231312241421. The reversal of 231312241411 is 114142213132.
231312241411 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 231312241411 - 211 = 231312239363 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (231312241421) 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 3 ways as a sum of consecutive naturals, for example, 3008586 + ... + 3084511.
It is an arithmetic number, because the mean of its divisors is an integer number (57829593118).
Almost surely, 2231312241411 is an apocalyptic number.
231312241411 is a deficient number, since it is larger than the sum of its proper divisors (6131061).
231312241411 is an equidigital number, since it uses as much as digits as its factorization.
231312241411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6131060.
The product of its digits is 1152, while the sum is 25.
Adding to 231312241411 its reverse (114142213132), we get a palindrome (345454454543).
The spelling of 231312241411 in words is "two hundred thirty-one billion, three hundred twelve million, two hundred forty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •