Base | Representation |
---|---|
bin | 1011000100111011011101… |
… | …0110011000011100010000 |
3 | 1121010022220221102200110110 |
4 | 2301032313112120130100 |
5 | 3044021210421210333 |
6 | 41523032543001320 |
7 | 2364632421061350 |
oct | 261166726303420 |
9 | 47108827380413 |
10 | 12179308381968 |
11 | 3976241082132 |
12 | 1448521899240 |
13 | 6a4671c6aca0 |
14 | 3016a59c2b60 |
15 | 161c29a60063 |
hex | b13b7598710 |
12179308381968 has 320 divisors, whose sum is σ = 38998460938752. Its totient is φ = 3189384806400.
The previous prime is 12179308381901. The next prime is 12179308381969. The reversal of 12179308381968 is 86918380397121.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 12179308381899 and 12179308381908.
It is not an unprimeable number, because it can be changed into a prime (12179308381969) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1097921830 + ... + 1097932922.
Almost surely, 212179308381968 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 12179308381968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19499230469376).
12179308381968 is an abundant number, since it is smaller than the sum of its proper divisors (26819152556784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12179308381968 is a wasteful number, since it uses less digits than its factorization.
12179308381968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12882 (or 12876 counting only the distinct ones).
The product of its (nonzero) digits is 31352832, while the sum is 66.
The spelling of 12179308381968 in words is "twelve trillion, one hundred seventy-nine billion, three hundred eight million, three hundred eighty-one thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •