Base | Representation |
---|---|
bin | 1111011101111000100… |
… | …11001100010010110111 |
3 | 1212210201222100112212201 |
4 | 13232330103030102313 |
5 | 32201342133000421 |
6 | 1044050142125331 |
7 | 53252403346600 |
oct | 7567423142267 |
9 | 1783658315781 |
10 | 531440125111 |
11 | 195423106875 |
12 | 86bb6280847 |
13 | 3b1649a00bc |
14 | 1ba16a26da7 |
15 | dc55dcab91 |
hex | 7bbc4cc4b7 |
531440125111 has 24 divisors (see below), whose sum is σ = 648011692944. Its totient is φ = 434074677120.
The previous prime is 531440125091. The next prime is 531440125123. The reversal of 531440125111 is 111521044135.
It is a happy number.
It is not a de Polignac number, because 531440125111 - 27 = 531440124983 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 531440125111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (531440126111) 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 23 ways as a sum of consecutive naturals, for example, 2989540 + ... + 3162313.
It is an arithmetic number, because the mean of its divisors is an integer number (27000487206).
Almost surely, 2531440125111 is an apocalyptic number.
531440125111 is a deficient number, since it is larger than the sum of its proper divisors (116571567833).
531440125111 is a wasteful number, since it uses less digits than its factorization.
531440125111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6151951 (or 6151944 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 531440125111 its reverse (111521044135), we get a palindrome (642961169246).
The spelling of 531440125111 in words is "five hundred thirty-one billion, four hundred forty million, one hundred twenty-five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •