Base | Representation |
---|---|
bin | 111100010100101101101101… |
… | …0110100001000101001010101 |
3 | 2120120202001122220012002221010 |
4 | 1320221123122310020221111 |
5 | 1024022023420310014141 |
6 | 5120304005451042433 |
7 | 216523326625321020 |
oct | 17051333264105125 |
9 | 2516661586162833 |
10 | 530612520782421 |
11 | 144084562a3a590 |
12 | 4b618317740419 |
13 | 19a0c71377561c |
14 | 9505ad69101b7 |
15 | 41526b1886416 |
hex | 1e296dad08a55 |
530612520782421 has 64 divisors (see below), whose sum is σ = 882372984569856. Its totient is φ = 275544193176000.
The previous prime is 530612520782413. The next prime is 530612520782459. The reversal of 530612520782421 is 124287025216035.
It is not a de Polignac number, because 530612520782421 - 23 = 530612520782413 is a prime.
It is a super-2 number, since 2×5306125207824212 (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 (530612520782471) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 11686705506 + ... + 11686750908.
It is an arithmetic number, because the mean of its divisors is an integer number (13787077883904).
Almost surely, 2530612520782421 is an apocalyptic number.
It is an amenable number.
530612520782421 is a deficient number, since it is larger than the sum of its proper divisors (351760463787435).
530612520782421 is a wasteful number, since it uses less digits than its factorization.
530612520782421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62422.
The product of its (nonzero) digits is 1612800, while the sum is 48.
Adding to 530612520782421 its reverse (124287025216035), we get a palindrome (654899545998456).
The spelling of 530612520782421 in words is "five hundred thirty trillion, six hundred twelve billion, five hundred twenty million, seven hundred eighty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •