Base | Representation |
---|---|
bin | 100101101001010010111001… |
… | …1011011001100111101110111 |
3 | 1121102102211001211101001220110 |
4 | 1023102211303123030331313 |
5 | 321400222322203134201 |
6 | 3132131254544234103 |
7 | 126514266420514620 |
oct | 11322456333147567 |
9 | 1542384054331813 |
10 | 331131030130551 |
11 | 96565976a38962 |
12 | 3117b4b400b933 |
13 | 1129c6a3240b11 |
14 | 5baab82446a47 |
15 | 28437283966d6 |
hex | 12d29736ccf77 |
331131030130551 has 32 divisors (see below), whose sum is σ = 518594097725440. Its totient is φ = 184034173710816.
The previous prime is 331131030130513. The next prime is 331131030130567. The reversal of 331131030130551 is 155031030131133.
It is a happy number.
It is not a de Polignac number, because 331131030130551 - 27 = 331131030130423 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331131030180551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1489416931 + ... + 1489639236.
It is an arithmetic number, because the mean of its divisors is an integer number (16206065553920).
Almost surely, 2331131030130551 is an apocalyptic number.
331131030130551 is a deficient number, since it is larger than the sum of its proper divisors (187463067594889).
331131030130551 is a wasteful number, since it uses less digits than its factorization.
331131030130551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2979056323.
The product of its (nonzero) digits is 6075, while the sum is 30.
Adding to 331131030130551 its reverse (155031030131133), we get a palindrome (486162060261684).
The spelling of 331131030130551 in words is "three hundred thirty-one trillion, one hundred thirty-one billion, thirty million, one hundred thirty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.390 sec. • engine limits •