Base | Representation |
---|---|
bin | 10000000100101011110… |
… | …11001001110111110000 |
3 | 1221210111201120001001011 |
4 | 20002111323021313300 |
5 | 33022022402013000 |
6 | 1101413154520304 |
7 | 54620536054606 |
oct | 10022573116760 |
9 | 1853451501034 |
10 | 552271126000 |
11 | 1a3242720090 |
12 | 8b04a596094 |
13 | 40104593329 |
14 | 1ca31427876 |
15 | e574a942ba |
hex | 8095ec9df0 |
552271126000 has 80 divisors (see below), whose sum is σ = 1456790875488. Its totient is φ = 200825856000.
The previous prime is 552271125953. The next prime is 552271126021. The reversal of 552271126000 is 621172255.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-3 number, since 3×5522711260003 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12529617 + ... + 12573616.
Almost surely, 2552271126000 is an apocalyptic number.
552271126000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
552271126000 is an abundant number, since it is smaller than the sum of its proper divisors (904519749488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
552271126000 is a wasteful number, since it uses less digits than its factorization.
552271126000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25103267 (or 25103251 counting only the distinct ones).
The product of its (nonzero) digits is 8400, while the sum is 31.
Adding to 552271126000 its reverse (621172255), we get a palindrome (552892298255).
The spelling of 552271126000 in words is "five hundred fifty-two billion, two hundred seventy-one million, one hundred twenty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •