Base | Representation |
---|---|
bin | 1101011101101100111… |
… | …0010111110010011001 |
3 | 211010001110220201002110 |
4 | 3113123032113302121 |
5 | 12242211134310231 |
6 | 254132442422533 |
7 | 22466052064644 |
oct | 3273316276231 |
9 | 733043821073 |
10 | 231311244441 |
11 | 8a10a192622 |
12 | 389b5801a49 |
13 | 18a74258354 |
14 | b2a4736a5b |
15 | 603c260046 |
hex | 35db397c99 |
231311244441 has 8 divisors (see below), whose sum is σ = 311468606784. Its totient is φ = 152680689200.
The previous prime is 231311244389. The next prime is 231311244449. The reversal of 231311244441 is 144442113132.
It is a happy number.
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 231311244441 - 26 = 231311244377 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 231311244399 and 231311244408.
It is not an unprimeable number, because it can be changed into a prime (231311244449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 381701421 + ... + 381702026.
It is an arithmetic number, because the mean of its divisors is an integer number (38933575848).
Almost surely, 2231311244441 is an apocalyptic number.
It is an amenable number.
231311244441 is a deficient number, since it is larger than the sum of its proper divisors (80157362343).
231311244441 is a wasteful number, since it uses less digits than its factorization.
231311244441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 763403551.
The product of its digits is 9216, while the sum is 30.
Adding to 231311244441 its reverse (144442113132), we get a palindrome (375753357573).
The spelling of 231311244441 in words is "two hundred thirty-one billion, three hundred eleven million, two hundred forty-four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •