Base | Representation |
---|---|
bin | 111110111111111010101110… |
… | …0101011000111100001101111 |
3 | 2200200001111201201100020221210 |
4 | 1331333311130223013201233 |
5 | 1040113032400224212421 |
6 | 5242321321500125503 |
7 | 224502322325243310 |
oct | 17577653453074157 |
9 | 2620044651306853 |
10 | 554142530304111 |
11 | 150626588988591 |
12 | 52198650236893 |
13 | 1aa28554a54038 |
14 | 9aba8da690607 |
15 | 440e7bb44e576 |
hex | 1f7fd5cac786f |
554142530304111 has 16 divisors (see below), whose sum is σ = 871646622169088. Its totient is φ = 306438265605600.
The previous prime is 554142530304073. The next prime is 554142530304179. The reversal of 554142530304111 is 111403035241455.
It is not a de Polignac number, because 554142530304111 - 213 = 554142530295919 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 554142530304111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (554142530306111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 425608701580 + ... + 425608702881.
It is an arithmetic number, because the mean of its divisors is an integer number (54477913885568).
Almost surely, 2554142530304111 is an apocalyptic number.
554142530304111 is a deficient number, since it is larger than the sum of its proper divisors (317504091864977).
554142530304111 is a wasteful number, since it uses less digits than its factorization.
554142530304111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 851217404502.
The product of its (nonzero) digits is 144000, while the sum is 39.
Adding to 554142530304111 its reverse (111403035241455), we get a palindrome (665545565545566).
The spelling of 554142530304111 in words is "five hundred fifty-four trillion, one hundred forty-two billion, five hundred thirty million, three hundred four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •