Base | Representation |
---|---|
bin | 1111011100000000101… |
… | …01111001001001000100 |
3 | 1212201010212112021020000 |
4 | 13232000111321021010 |
5 | 32142312123401012 |
6 | 1043402245441300 |
7 | 53215440210654 |
oct | 7560025711104 |
9 | 1781125467200 |
10 | 530434200132 |
11 | 194a57306511 |
12 | 86975410230 |
13 | 3b03446a115 |
14 | 1b95d1b6364 |
15 | dbe7928ddc |
hex | 7b80579244 |
530434200132 has 60 divisors (see below), whose sum is σ = 1390438452480. Its totient is φ = 176329585584.
The previous prime is 530434200097. The next prime is 530434200151. The reversal of 530434200132 is 231002434035.
530434200132 is a `hidden beast` number, since 5 + 304 + 342 + 0 + 0 + 13 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 530434200096 and 530434200105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 2111532 + ... + 2349347.
It is an arithmetic number, because the mean of its divisors is an integer number (23173974208).
Almost surely, 2530434200132 is an apocalyptic number.
It is an amenable number.
530434200132 is an abundant number, since it is smaller than the sum of its proper divisors (860004252348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530434200132 is a wasteful number, since it uses less digits than its factorization.
530434200132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4461262 (or 4461251 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 27.
Adding to 530434200132 its reverse (231002434035), we get a palindrome (761436634167).
The spelling of 530434200132 in words is "five hundred thirty billion, four hundred thirty-four million, two hundred thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •