Base | Representation |
---|---|
bin | 111110101010101100001111… |
… | …0100011100011111101001110 |
3 | 2200021201121121022202001200010 |
4 | 1331111120132203203331032 |
5 | 1034222233210031421110 |
6 | 5232205210301414050 |
7 | 224051464311230202 |
oct | 17525303643437516 |
9 | 2607647538661603 |
10 | 551225205342030 |
11 | 14a70132a00552a |
12 | 519a7179b6a326 |
13 | 1a87641061281b |
14 | 9a19629908b02 |
15 | 43ad974e7d020 |
hex | 1f5561e8e3f4e |
551225205342030 has 16 divisors (see below), whose sum is σ = 1322940492820944. Its totient is φ = 146993388091200.
The previous prime is 551225205341999. The next prime is 551225205342197. The reversal of 551225205342030 is 30243502522155.
It is a self number, because there is not a number n which added to its sum of digits gives 551225205342030.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 9187086755671 + ... + 9187086755730.
It is an arithmetic number, because the mean of its divisors is an integer number (82683780801309).
Almost surely, 2551225205342030 is an apocalyptic number.
551225205342030 is an abundant number, since it is smaller than the sum of its proper divisors (771715287478914).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
551225205342030 is a wasteful number, since it uses less digits than its factorization.
551225205342030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18374173511411.
The product of its (nonzero) digits is 360000, while the sum is 39.
Adding to 551225205342030 its reverse (30243502522155), we get a palindrome (581468707864185).
The spelling of 551225205342030 in words is "five hundred fifty-one trillion, two hundred twenty-five billion, two hundred five million, three hundred forty-two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •