Base | Representation |
---|---|
bin | 1111011011100100100… |
… | …10101001101111101001 |
3 | 1212200112102221220201220 |
4 | 13231302102221233221 |
5 | 32141321302011414 |
6 | 1043323025132253 |
7 | 53206545426654 |
oct | 7556222515751 |
9 | 1780472856656 |
10 | 530198469609 |
11 | 1949462396a6 |
12 | 8690a48a089 |
13 | 3acc76826c3 |
14 | 1b939b7289b |
15 | dbd1db2ca9 |
hex | 7b724a9be9 |
530198469609 has 48 divisors (see below), whose sum is σ = 779752535040. Its totient is φ = 319493613600.
The previous prime is 530198469569. The next prime is 530198469623. The reversal of 530198469609 is 906964891035.
It is not a de Polignac number, because 530198469609 - 227 = 530064251881 is a prime.
It is a super-2 number, since 2×5301984696092 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (530198469629) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 3821004 + ... + 3957330.
It is an arithmetic number, because the mean of its divisors is an integer number (16244844480).
Almost surely, 2530198469609 is an apocalyptic number.
It is an amenable number.
530198469609 is a deficient number, since it is larger than the sum of its proper divisors (249554065431).
530198469609 is a wasteful number, since it uses less digits than its factorization.
530198469609 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136482 (or 136451 counting only the distinct ones).
The product of its (nonzero) digits is 12597120, while the sum is 60.
The spelling of 530198469609 in words is "five hundred thirty billion, one hundred ninety-eight million, four hundred sixty-nine thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •