Base | Representation |
---|---|
bin | 111100010010010100111110… |
… | …1101111000001111100001101 |
3 | 2120112120201002110120211010101 |
4 | 1320210221331233001330031 |
5 | 1024001140220130224103 |
6 | 5115453204432011101 |
7 | 216460536166555651 |
oct | 17044517557017415 |
9 | 2515521073524111 |
10 | 530284541648653 |
11 | 143a684582a8a40 |
12 | 4b584844090a91 |
13 | 199b780515377c |
14 | 94d3ca18d0a61 |
15 | 4148db7bd3a1d |
hex | 1e24a7dbc1f0d |
530284541648653 has 8 divisors (see below), whose sum is σ = 578553527803680. Its totient is φ = 482025772252080.
The previous prime is 530284541648611. The next prime is 530284541648689. The reversal of 530284541648653 is 356846145482035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-530284541648653 is a prime.
It is a super-2 number, since 2×5302845416486532 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530284511648653) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2554081083 + ... + 2554288696.
It is an arithmetic number, because the mean of its divisors is an integer number (72319190975460).
Almost surely, 2530284541648653 is an apocalyptic number.
It is an amenable number.
530284541648653 is a deficient number, since it is larger than the sum of its proper divisors (48268986155027).
530284541648653 is a wasteful number, since it uses less digits than its factorization.
530284541648653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5108379227.
The product of its (nonzero) digits is 331776000, while the sum is 64.
The spelling of 530284541648653 in words is "five hundred thirty trillion, two hundred eighty-four billion, five hundred forty-one million, six hundred forty-eight thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •