Base | Representation |
---|---|
bin | 11101100011100111001… |
… | …00100010011101110111 |
3 | 10121002022111211021100221 |
4 | 32301303210202131313 |
5 | 113114322104140210 |
6 | 2054312055315211 |
7 | 133241210053222 |
oct | 16616344423567 |
9 | 3532274737327 |
10 | 1015551240055 |
11 | 361769221800 |
12 | 1449a207bb07 |
13 | 749c609a631 |
14 | 3721d9605b9 |
15 | 1b63bb661da |
hex | ec73922777 |
1015551240055 has 24 divisors (see below), whose sum is σ = 1340546404176. Its totient is φ = 738017047680.
The previous prime is 1015551240049. The next prime is 1015551240059. The reversal of 1015551240055 is 5500421555101.
It is not a de Polignac number, because 1015551240055 - 25 = 1015551240023 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 1015551240055.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1015551240059) 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, 148579 + ... + 1432891.
It is an arithmetic number, because the mean of its divisors is an integer number (55856100174).
Almost surely, 21015551240055 is an apocalyptic number.
1015551240055 is a deficient number, since it is larger than the sum of its proper divisors (324995164121).
1015551240055 is a wasteful number, since it uses less digits than its factorization.
1015551240055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1285647 (or 1285636 counting only the distinct ones).
The product of its (nonzero) digits is 25000, while the sum is 34.
Adding to 1015551240055 its reverse (5500421555101), we get a palindrome (6515972795156).
The spelling of 1015551240055 in words is "one trillion, fifteen billion, five hundred fifty-one million, two hundred forty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •