Base | Representation |
---|---|
bin | 1111011011100000000… |
… | …10010010101111010100 |
3 | 1212200102210202021221121 |
4 | 13231300002102233110 |
5 | 32141232110023034 |
6 | 1043315154053324 |
7 | 53205605654425 |
oct | 7556002225724 |
9 | 1780383667847 |
10 | 530160626644 |
11 | 194926941720 |
12 | 868b987a244 |
13 | 3acbc89290c |
14 | 1b934b2164c |
15 | dbcd8da1b4 |
hex | 7b70092bd4 |
530160626644 has 48 divisors (see below), whose sum is σ = 1111716103680. Its totient is φ = 218372790240.
The previous prime is 530160626641. The next prime is 530160626693. The reversal of 530160626644 is 446626061035.
It is a self number, because there is not a number n which added to its sum of digits gives 530160626644.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530160626641) by changing a digit.
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, 13766934 + ... + 13805389.
It is an arithmetic number, because the mean of its divisors is an integer number (23160752160).
Almost surely, 2530160626644 is an apocalyptic number.
It is an amenable number.
530160626644 is an abundant number, since it is smaller than the sum of its proper divisors (581555477036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530160626644 is a wasteful number, since it uses less digits than its factorization.
530160626644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27572380 (or 27572378 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 43.
Adding to 530160626644 its reverse (446626061035), we get a palindrome (976786687679).
The spelling of 530160626644 in words is "five hundred thirty billion, one hundred sixty million, six hundred twenty-six thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •