Base | Representation |
---|---|
bin | 111000000110110010… |
… | …100011010010000000 |
3 | 12202111110200201011210 |
4 | 320012302203102000 |
5 | 1441334311112102 |
6 | 43401522210120 |
7 | 4231613636214 |
oct | 700662432200 |
9 | 182443621153 |
10 | 60243457152 |
11 | 2360495201a |
12 | b8134b3940 |
13 | 58b101b788 |
14 | 2cb6d48944 |
15 | 1878ce336c |
hex | e06ca3480 |
60243457152 has 64 divisors (see below), whose sum is σ = 160048526400. Its totient is φ = 20077784064.
The previous prime is 60243457151. The next prime is 60243457163. The reversal of 60243457152 is 25175434206.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×602434571522 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 60243457152.
It is not an unprimeable number, because it can be changed into a prime (60243457151) 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, 3496174 + ... + 3513362.
It is an arithmetic number, because the mean of its divisors is an integer number (2500758225).
Almost surely, 260243457152 is an apocalyptic number.
It is an amenable number.
60243457152 is an abundant number, since it is smaller than the sum of its proper divisors (99805069248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60243457152 is a wasteful number, since it uses less digits than its factorization.
60243457152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26333 (or 26321 counting only the distinct ones).
The product of its (nonzero) digits is 201600, while the sum is 39.
The spelling of 60243457152 in words is "sixty billion, two hundred forty-three million, four hundred fifty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •