Base | Representation |
---|---|
bin | 111110110001001111010110… |
… | …0110011101100100010011100 |
3 | 2200101220122202021221002021110 |
4 | 1331202132230303230202130 |
5 | 1034332004442431213040 |
6 | 5234134500030102020 |
7 | 224203506103366665 |
oct | 17542365463544234 |
9 | 2611818667832243 |
10 | 552125240101020 |
11 | 14aa18aaa186263 |
12 | 51b116a194a910 |
13 | 1a91025734ba81 |
14 | 9a4b00b77c36c |
15 | 43c70a0573980 |
hex | 1f627accec89c |
552125240101020 has 96 divisors (see below), whose sum is σ = 1641277390471488. Its totient is φ = 138201100849152.
The previous prime is 552125240101013. The next prime is 552125240101033. The reversal of 552125240101020 is 20101042521255.
It is a super-3 number, since 3×5521252401010203 (a number of 45 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 725221759 + ... + 725982678.
It is an arithmetic number, because the mean of its divisors is an integer number (17096639484078).
Almost surely, 2552125240101020 is an apocalyptic number.
It is an amenable number.
552125240101020 is an abundant number, since it is smaller than the sum of its proper divisors (1089152150370468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
552125240101020 is a wasteful number, since it uses less digits than its factorization.
552125240101020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1451204839 (or 1451204837 counting only the distinct ones).
The product of its (nonzero) digits is 8000, while the sum is 30.
Adding to 552125240101020 its reverse (20101042521255), we get a palindrome (572226282622275).
The spelling of 552125240101020 in words is "five hundred fifty-two trillion, one hundred twenty-five billion, two hundred forty million, one hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •