Base | Representation |
---|---|
bin | 1111110110000011001… |
… | …00000000001111000011 |
3 | 1221001020002201010211011 |
4 | 13323001210000033003 |
5 | 32404424302221011 |
6 | 1054033334501351 |
7 | 54222032603602 |
oct | 7730144001703 |
9 | 1831202633734 |
10 | 544413320131 |
11 | 19a98014324a |
12 | 89616b04857 |
13 | 3c451648165 |
14 | 1c4c79b5a39 |
15 | e264cd5621 |
hex | 7ec19003c3 |
544413320131 has 16 divisors (see below), whose sum is σ = 554668156800. Its totient is φ = 534193619328.
The previous prime is 544413320089. The next prime is 544413320137. The reversal of 544413320131 is 131023314445.
It is a cyclic number.
It is not a de Polignac number, because 544413320131 - 217 = 544413189059 is a prime.
It is a super-2 number, since 2×5444133201312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 544413320093 and 544413320102.
It is not an unprimeable number, because it can be changed into a prime (544413320137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 153830760 + ... + 153834298.
It is an arithmetic number, because the mean of its divisors is an integer number (34666759800).
Almost surely, 2544413320131 is an apocalyptic number.
544413320131 is a deficient number, since it is larger than the sum of its proper divisors (10254836669).
544413320131 is a wasteful number, since it uses less digits than its factorization.
544413320131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7698.
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 544413320131 its reverse (131023314445), we get a palindrome (675436634576).
The spelling of 544413320131 in words is "five hundred forty-four billion, four hundred thirteen million, three hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •