Base | Representation |
---|---|
bin | 11011100001110011010100… |
… | …10110100101101011010100 |
3 | 21221100002112221201020112210 |
4 | 31300321222112211223110 |
5 | 30413301242131014322 |
6 | 332425230345113420 |
7 | 15515341024540152 |
oct | 1560715226455324 |
9 | 257302487636483 |
10 | 60535053376212 |
11 | 18319854537a08 |
12 | 6958122a88870 |
13 | 27a157acbac9c |
14 | 10d3cab19c3d2 |
15 | 6ee9c7cab70c |
hex | 370e6a5a5ad4 |
60535053376212 has 96 divisors (see below), whose sum is σ = 148546085732352. Its totient is φ = 19149752317696.
The previous prime is 60535053376211. The next prime is 60535053376241. The reversal of 60535053376212 is 21267335053506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60535053376211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 69405373 + ... + 70272155.
It is an arithmetic number, because the mean of its divisors is an integer number (1547355059712).
Almost surely, 260535053376212 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 60535053376212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (74273042866176).
60535053376212 is an abundant number, since it is smaller than the sum of its proper divisors (88011032356140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60535053376212 is a wasteful number, since it uses less digits than its factorization.
60535053376212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 868797 (or 868795 counting only the distinct ones).
The product of its (nonzero) digits is 3402000, while the sum is 48.
The spelling of 60535053376212 in words is "sixty trillion, five hundred thirty-five billion, fifty-three million, three hundred seventy-six thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •