Base | Representation |
---|---|
bin | 1111011100100000010… |
… | …11111001110000001010 |
3 | 1212201211101201010221020 |
4 | 13232100023321300022 |
5 | 32143333201013100 |
6 | 1043444503053310 |
7 | 53225145466146 |
oct | 7562013716012 |
9 | 1781741633836 |
10 | 530700016650 |
11 | 195083362391 |
12 | 86a2a441236 |
13 | 3b0775599bb |
14 | 1b98660c226 |
15 | dc10e345a0 |
hex | 7b902f9c0a |
530700016650 has 48 divisors (see below), whose sum is σ = 1317517441344. Its totient is φ = 141371466880.
The previous prime is 530700016597. The next prime is 530700016673. The reversal of 530700016650 is 56610007035.
It is a Curzon 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 23 ways as a sum of consecutive naturals, for example, 1713294 + ... + 1999193.
It is an arithmetic number, because the mean of its divisors is an integer number (27448280028).
Almost surely, 2530700016650 is an apocalyptic number.
530700016650 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
530700016650 is an abundant number, since it is smaller than the sum of its proper divisors (786817424694).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530700016650 is a wasteful number, since it uses less digits than its factorization.
530700016650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3713455 (or 3713450 counting only the distinct ones).
The product of its (nonzero) digits is 18900, while the sum is 33.
The spelling of 530700016650 in words is "five hundred thirty billion, seven hundred million, sixteen thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.310 sec. • engine limits •