Base | Representation |
---|---|
bin | 10001010011011001100… |
… | …001111001100011101000 |
3 | 11012200011200010202012001 |
4 | 101103121201321203220 |
5 | 123440143443003242 |
6 | 2310125153300344 |
7 | 151623012423622 |
oct | 21233141714350 |
9 | 4180150122161 |
10 | 1189060516072 |
11 | 419306731990 |
12 | 172545b646b4 |
13 | 8818808b1b0 |
14 | 4179d6cbc12 |
15 | 20de4601eb7 |
hex | 114d98798e8 |
1189060516072 has 64 divisors (see below), whose sum is σ = 2621281924800. Its totient is φ = 498521226240.
The previous prime is 1189060516057. The next prime is 1189060516079. The reversal of 1189060516072 is 2706150609811.
It is not an unprimeable number, because it can be changed into a prime (1189060516079) 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 15 ways as a sum of consecutive naturals, for example, 1083079 + ... + 1884457.
It is an arithmetic number, because the mean of its divisors is an integer number (40957530075).
Almost surely, 21189060516072 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 1189060516072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1310640962400).
1189060516072 is an abundant number, since it is smaller than the sum of its proper divisors (1432221408728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1189060516072 is a wasteful number, since it uses less digits than its factorization.
1189060516072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 802706 (or 802702 counting only the distinct ones).
The product of its (nonzero) digits is 181440, while the sum is 46.
The spelling of 1189060516072 in words is "one trillion, one hundred eighty-nine billion, sixty million, five hundred sixteen thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •