Base | Representation |
---|---|
bin | 11101100100111111100010… |
… | …00010110111110011111000 |
3 | 22112022000122221201220010202 |
4 | 32302133301002313303320 |
5 | 32011130004324402042 |
6 | 350200115221101332 |
7 | 16462116402264500 |
oct | 1662376102676370 |
9 | 275260587656122 |
10 | 65042733825272 |
11 | 197a7517647035 |
12 | 7365873b57848 |
13 | 2a3a6711c28a8 |
14 | 120c1297a6a00 |
15 | 77bd9dcc3632 |
hex | 3b27f10b7cf8 |
65042733825272 has 96 divisors (see below), whose sum is σ = 142150733010720. Its totient is φ = 27819569111040.
The previous prime is 65042733825233. The next prime is 65042733825287. The reversal of 65042733825272 is 27252833724056.
It is a Harshad number since it is a multiple of its sum of digits (56).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 873711572 + ... + 873786012.
It is an arithmetic number, because the mean of its divisors is an integer number (1480736802195).
Almost surely, 265042733825272 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 65042733825272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71075366505360).
65042733825272 is an abundant number, since it is smaller than the sum of its proper divisors (77107999185448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65042733825272 is a wasteful number, since it uses less digits than its factorization.
65042733825272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78901 (or 78890 counting only the distinct ones).
The product of its (nonzero) digits is 33868800, while the sum is 56.
The spelling of 65042733825272 in words is "sixty-five trillion, forty-two billion, seven hundred thirty-three million, eight hundred twenty-five thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •