Base | Representation |
---|---|
bin | 1111011100001110100… |
… | …11100000011001011000 |
3 | 1212201110000100002002121 |
4 | 13232013103200121120 |
5 | 32143032024440000 |
6 | 1043422021311024 |
7 | 53221356135046 |
oct | 7560723403130 |
9 | 1781400302077 |
10 | 530551015000 |
11 | 195007242226 |
12 | 869a8565474 |
13 | 3b05271a346 |
14 | 1b970903396 |
15 | dc02d00b1a |
hex | 7b874e0658 |
530551015000 has 80 divisors (see below), whose sum is σ = 1244975074200. Its totient is φ = 211897056000.
The previous prime is 530551014953. The next prime is 530551015091. The reversal of 530551015000 is 510155035.
It is a Harshad number since it is a multiple of its sum of digits (25).
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 19 ways as a sum of consecutive naturals, for example, 3214492 + ... + 3375508.
Almost surely, 2530551015000 is an apocalyptic number.
530551015000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 530551015000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (622487537100).
530551015000 is an abundant number, since it is smaller than the sum of its proper divisors (714424059200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530551015000 is a wasteful number, since it uses less digits than its factorization.
530551015000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161702 (or 161683 counting only the distinct ones).
The product of its (nonzero) digits is 1875, while the sum is 25.
The spelling of 530551015000 in words is "five hundred thirty billion, five hundred fifty-one million, fifteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •