Base | Representation |
---|---|
bin | 1111011100001101101… |
… | …10100000001110111001 |
3 | 1212201102111000210221200 |
4 | 13232012312200032321 |
5 | 32143023103142103 |
6 | 1043421150324413 |
7 | 53221234411236 |
oct | 7560666401671 |
9 | 1781374023850 |
10 | 530543412153 |
11 | 195002a1a087 |
12 | 869a5ab9709 |
13 | 3b050c87911 |
14 | 1b96d8c478d |
15 | dc022ed0a3 |
hex | 7b86da03b9 |
530543412153 has 12 divisors (see below), whose sum is σ = 811419336468. Its totient is φ = 332889984000.
The previous prime is 530543412131. The next prime is 530543412283. The reversal of 530543412153 is 351214345035.
530543412153 is a `hidden beast` number, since 5 + 3 + 0 + 5 + 434 + 1 + 215 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 379865134224 + 150678277929 = 616332^2 + 388173^2 .
It is not a de Polignac number, because 530543412153 - 26 = 530543412089 is a prime.
It is not an unprimeable number, because it can be changed into a prime (530543412853) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1733801848 + ... + 1733802153.
It is an arithmetic number, because the mean of its divisors is an integer number (67618278039).
Almost surely, 2530543412153 is an apocalyptic number.
It is an amenable number.
530543412153 is a deficient number, since it is larger than the sum of its proper divisors (280875924315).
530543412153 is a wasteful number, since it uses less digits than its factorization.
530543412153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3467604024 (or 3467604021 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
Adding to 530543412153 its reverse (351214345035), we get a palindrome (881757757188).
The spelling of 530543412153 in words is "five hundred thirty billion, five hundred forty-three million, four hundred twelve thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •