Base | Representation |
---|---|
bin | 110000100011001100… |
… | …001110110000010000 |
3 | 11222120000211012122102 |
4 | 300203030032300100 |
5 | 1323230241010042 |
6 | 35540451055532 |
7 | 3523554553505 |
oct | 604314166020 |
9 | 158500735572 |
10 | 52130016272 |
11 | 20121042884 |
12 | a12a2a15a8 |
13 | 4bba13a099 |
14 | 27475914ac |
15 | 155188ab32 |
hex | c2330ec10 |
52130016272 has 40 divisors (see below), whose sum is σ = 104548022040. Its totient is φ = 25150970880.
The previous prime is 52130016271. The next prime is 52130016391. The reversal of 52130016272 is 27261003125.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 393784336 + 51736231936 = 19844^2 + 227456^2 .
It is a Harshad number since it is a multiple of its sum of digits (29).
It is not an unprimeable number, because it can be changed into a prime (52130016271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 752372 + ... + 818732.
It is an arithmetic number, because the mean of its divisors is an integer number (2613700551).
Almost surely, 252130016272 is an apocalyptic number.
It is an amenable number.
52130016272 is an abundant number, since it is smaller than the sum of its proper divisors (52418005768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52130016272 is a wasteful number, since it uses less digits than its factorization.
52130016272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68091 (or 68085 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 29.
Adding to 52130016272 its reverse (27261003125), we get a palindrome (79391019397).
The spelling of 52130016272 in words is "fifty-two billion, one hundred thirty million, sixteen thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •