Base | Representation |
---|---|
bin | 1111011011111100111… |
… | …00001111011110000110 |
3 | 1212201001122112002012211 |
4 | 13231332130033132012 |
5 | 32142230442410042 |
6 | 1043355150134034 |
7 | 53214602150614 |
oct | 7557634173606 |
9 | 1781048462184 |
10 | 530402310022 |
11 | 194a40304a52 |
12 | 869667b131a |
13 | 3b02a982a30 |
14 | 1b958c746b4 |
15 | dbe4c2a017 |
hex | 7b7e70f786 |
530402310022 has 32 divisors (see below), whose sum is σ = 858161304000. Its totient is φ = 244413447168.
The previous prime is 530402310017. The next prime is 530402310029. The reversal of 530402310022 is 220013204035.
It is a super-2 number, since 2×5304023100222 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 530402309975 and 530402310002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530402310029) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 90216879 + ... + 90222757.
It is an arithmetic number, because the mean of its divisors is an integer number (26817540750).
Almost surely, 2530402310022 is an apocalyptic number.
530402310022 is a deficient number, since it is larger than the sum of its proper divisors (327758993978).
530402310022 is a wasteful number, since it uses less digits than its factorization.
530402310022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10800.
The product of its (nonzero) digits is 1440, while the sum is 22.
Adding to 530402310022 its reverse (220013204035), we get a palindrome (750415514057).
The spelling of 530402310022 in words is "five hundred thirty billion, four hundred two million, three hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •