Base | Representation |
---|---|
bin | 111000010011001100… |
… | …100111010111010110 |
3 | 12210000222101021201200 |
4 | 320103030213113112 |
5 | 1442301103204324 |
6 | 43434315533330 |
7 | 4240022155023 |
oct | 702314472726 |
9 | 183028337650 |
10 | 60451616214 |
11 | 237013a8000 |
12 | b87115a246 |
13 | 59151a1712 |
14 | 2cd685254a |
15 | 188c20eec9 |
hex | e133275d6 |
60451616214 has 96 divisors (see below), whose sum is σ = 144553368960. Its totient is φ = 18256780080.
The previous prime is 60451616213. The next prime is 60451616221. The reversal of 60451616214 is 41261615406.
60451616214 is a `hidden beast` number, since 604 + 5 + 16 + 16 + 21 + 4 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60451616213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7350997 + ... + 7359215.
It is an arithmetic number, because the mean of its divisors is an integer number (1505764260).
Almost surely, 260451616214 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 60451616214, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72276684480).
60451616214 is an abundant number, since it is smaller than the sum of its proper divisors (84101752746).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60451616214 is a wasteful number, since it uses less digits than its factorization.
60451616214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8567 (or 8542 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The spelling of 60451616214 in words is "sixty billion, four hundred fifty-one million, six hundred sixteen thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •