Base | Representation |
---|---|
bin | 1111111111110000011… |
… | …10101010011011100000 |
3 | 1221112200100020021002121 |
4 | 13333320032222123200 |
5 | 33001113103034333 |
6 | 1100254444354024 |
7 | 54465142104343 |
oct | 7777016523340 |
9 | 1845610207077 |
10 | 549625439968 |
11 | 1a2105261000 |
12 | 8a630545914 |
13 | 3caa2415737 |
14 | 1c85dcd245a |
15 | e46c68c32d |
hex | 7ff83aa6e0 |
549625439968 has 192 divisors, whose sum is σ = 1234863995904. Its totient is φ = 240618470400.
The previous prime is 549625439941. The next prime is 549625439989. The reversal of 549625439968 is 869934526945.
It is a junction number, because it is equal to n+sod(n) for n = 549625439897 and 549625439906.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 133694233 + ... + 133698343.
It is an arithmetic number, because the mean of its divisors is an integer number (6431583312).
Almost surely, 2549625439968 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 549625439968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (617431997952).
549625439968 is an abundant number, since it is smaller than the sum of its proper divisors (685238555936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
549625439968 is a wasteful number, since it uses less digits than its factorization.
549625439968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4270 (or 4240 counting only the distinct ones).
The product of its digits is 503884800, while the sum is 70.
The spelling of 549625439968 in words is "five hundred forty-nine billion, six hundred twenty-five million, four hundred thirty-nine thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •