Base | Representation |
---|---|
bin | 1111011011110011010… |
… | …11111111110100010101 |
3 | 1212200212002110001201000 |
4 | 13231321223333310111 |
5 | 32142100033213013 |
6 | 1043343220453513 |
7 | 53212613222301 |
oct | 7557153776425 |
9 | 1780762401630 |
10 | 530322554133 |
11 | 1949aa290199 |
12 | 86943b4a299 |
13 | 3b0172a97b8 |
14 | 1b94c432d01 |
15 | dbdcc23973 |
hex | 7b79affd15 |
530322554133 has 16 divisors (see below), whose sum is σ = 788036660800. Its totient is φ = 352480241520.
The previous prime is 530322554123. The next prime is 530322554149. The reversal of 530322554133 is 331455223035.
530322554133 is a `hidden beast` number, since 5 + 30 + 32 + 25 + 541 + 33 = 666.
It is not a de Polignac number, because 530322554133 - 210 = 530322553109 is a prime.
It is a super-2 number, since 2×5303225541332 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530322554123) 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, 29661118 + ... + 29678991.
It is an arithmetic number, because the mean of its divisors is an integer number (49252291300).
Almost surely, 2530322554133 is an apocalyptic number.
It is an amenable number.
530322554133 is a deficient number, since it is larger than the sum of its proper divisors (257714106667).
530322554133 is a wasteful number, since it uses less digits than its factorization.
530322554133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59340449 (or 59340443 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 36.
Adding to 530322554133 its reverse (331455223035), we get a palindrome (861777777168).
The spelling of 530322554133 in words is "five hundred thirty billion, three hundred twenty-two million, five hundred fifty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •