Base | Representation |
---|---|
bin | 1111011011101111101… |
… | …10000000000100000011 |
3 | 1212200202221020112222220 |
4 | 13231313312000010003 |
5 | 32142014123402042 |
6 | 1043340153502123 |
7 | 53212056262500 |
oct | 7556766000403 |
9 | 1780687215886 |
10 | 530291622147 |
11 | 194993883571 |
12 | 86935711943 |
13 | 3b010a69551 |
14 | 1b9482a04a7 |
15 | dbda1638ec |
hex | 7b77d80103 |
530291622147 has 12 divisors (see below), whose sum is σ = 822493128456. Its totient is φ = 303023784000.
The previous prime is 530291622103. The next prime is 530291622169. The reversal of 530291622147 is 741226192035.
It is a happy number.
It is not a de Polignac number, because 530291622147 - 216 = 530291556611 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 530291622099 and 530291622108.
It is not an unprimeable number, because it can be changed into a prime (530291622347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1803712854 + ... + 1803713147.
It is an arithmetic number, because the mean of its divisors is an integer number (68541094038).
Almost surely, 2530291622147 is an apocalyptic number.
530291622147 is a deficient number, since it is larger than the sum of its proper divisors (292201506309).
530291622147 is a wasteful number, since it uses less digits than its factorization.
530291622147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3607426018 (or 3607426011 counting only the distinct ones).
The product of its (nonzero) digits is 181440, while the sum is 42.
The spelling of 530291622147 in words is "five hundred thirty billion, two hundred ninety-one million, six hundred twenty-two thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •