Base | Representation |
---|---|
bin | 10111101110010111101110… |
… | …11110000111110111110100 |
3 | 20211201111000110201021001120 |
4 | 23313023313132013313310 |
5 | 23314231322102134012 |
6 | 302542540155223540 |
7 | 13663134445440363 |
oct | 1367136736076764 |
9 | 224644013637046 |
10 | 52170824646132 |
11 | 15694582470975 |
12 | 5a2707b747bb0 |
13 | 23158c2a133ca |
14 | cc511d4737da |
15 | 607139a7c58c |
hex | 2f72f7787df4 |
52170824646132 has 24 divisors (see below), whose sum is σ = 122006714083296. Its totient is φ = 17351019180768.
The previous prime is 52170824646079. The next prime is 52170824646133. The reversal of 52170824646132 is 23164642807125.
It is a super-2 number, since 2×521708246461322 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52170824646133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4906957123 + ... + 4906967754.
It is an arithmetic number, because the mean of its divisors is an integer number (5083613086804).
Almost surely, 252170824646132 is an apocalyptic number.
It is an amenable number.
52170824646132 is an abundant number, since it is smaller than the sum of its proper divisors (69835889437164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52170824646132 is a wasteful number, since it uses less digits than its factorization.
52170824646132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9813925327 (or 9813925325 counting only the distinct ones).
The product of its (nonzero) digits is 3870720, while the sum is 51.
The spelling of 52170824646132 in words is "fifty-two trillion, one hundred seventy billion, eight hundred twenty-four million, six hundred forty-six thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •