Base | Representation |
---|---|
bin | 10000000100111111110… |
… | …11110010101111010000 |
3 | 1221210221102120020210120 |
4 | 20002133323302233100 |
5 | 33022343400044202 |
6 | 1101441554230240 |
7 | 54624645402363 |
oct | 10023773625720 |
9 | 1853842506716 |
10 | 552439065552 |
11 | 1a33194a5600 |
12 | 8b096885380 |
13 | 4013030384a |
14 | 1ca498620da |
15 | e5846b90bc |
hex | 809fef2bd0 |
552439065552 has 120 divisors (see below), whose sum is σ = 1576634276448. Its totient is φ = 166555656960.
The previous prime is 552439065511. The next prime is 552439065553. The reversal of 552439065552 is 255560934255.
It is a super-2 number, since 2×5524390655522 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 552439065495 and 552439065504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (552439065553) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 902763 + ... + 1385589.
Almost surely, 2552439065552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 552439065552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (788317138224).
552439065552 is an abundant number, since it is smaller than the sum of its proper divisors (1024195210896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
552439065552 is a wasteful number, since it uses less digits than its factorization.
552439065552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 483057 (or 483040 counting only the distinct ones).
The product of its (nonzero) digits is 8100000, while the sum is 51.
The spelling of 552439065552 in words is "five hundred fifty-two billion, four hundred thirty-nine million, sixty-five thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •