Base | Representation |
---|---|
bin | 10111011111010010001011… |
… | …00110101000000111001100 |
3 | 20202212220222122221010010010 |
4 | 23233221011212220013030 |
5 | 23232233201240032442 |
6 | 301504445544513220 |
7 | 13610523503510025 |
oct | 1357510546500714 |
9 | 222786878833103 |
10 | 51652444455372 |
11 | 15504751356082 |
12 | 596270b17b810 |
13 | 22a8a5c96b117 |
14 | ca7dc5137c4c |
15 | 5e88ea4e1b9c |
hex | 2efa459a81cc |
51652444455372 has 48 divisors (see below), whose sum is σ = 120777600706560. Its totient is φ = 17181022169472.
The previous prime is 51652444455341. The next prime is 51652444455377. The reversal of 51652444455372 is 27355444425615.
51652444455372 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (51652444455377) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 224327088 + ... + 224557224.
It is an arithmetic number, because the mean of its divisors is an integer number (2516200014720).
Almost surely, 251652444455372 is an apocalyptic number.
It is an amenable number.
51652444455372 is an abundant number, since it is smaller than the sum of its proper divisors (69125156251188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51652444455372 is a wasteful number, since it uses less digits than its factorization.
51652444455372 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269670 (or 269668 counting only the distinct ones).
The product of its digits is 80640000, while the sum is 57.
The spelling of 51652444455372 in words is "fifty-one trillion, six hundred fifty-two billion, four hundred forty-four million, four hundred fifty-five thousand, three hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •