Base | Representation |
---|---|
bin | 1111011011101010110… |
… | …11100010010101100110 |
3 | 1212200200010001100111200 |
4 | 13231311123202111212 |
5 | 32141423242131324 |
6 | 1043332145543330 |
7 | 53211055145301 |
oct | 7556533422546 |
9 | 1780603040450 |
10 | 530251130214 |
11 | 194972a37363 |
12 | 86924044b46 |
13 | 3b00555cb20 |
14 | 1b942b5db38 |
15 | dbd6815ec9 |
hex | 7b756e2566 |
530251130214 has 48 divisors (see below), whose sum is σ = 1248201837792. Its totient is φ = 161710343424.
The previous prime is 530251130207. The next prime is 530251130231. The reversal of 530251130214 is 412031152035.
530251130214 is a `hidden beast` number, since 5 + 302 + 51 + 1 + 302 + 1 + 4 = 666.
It is a super-2 number, since 2×5302511302142 (a number of 24 digits) contains 22 as substring.
It is a Curzon number.
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 23 ways as a sum of consecutive naturals, for example, 10000242 + ... + 10053125.
It is an arithmetic number, because the mean of its divisors is an integer number (26004204954).
Almost surely, 2530251130214 is an apocalyptic number.
530251130214 is an abundant number, since it is smaller than the sum of its proper divisors (717950707578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530251130214 is a wasteful number, since it uses less digits than its factorization.
530251130214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20053501 (or 20053498 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 530251130214 its reverse (412031152035), we get a palindrome (942282282249).
The spelling of 530251130214 in words is "five hundred thirty billion, two hundred fifty-one million, one hundred thirty thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •