Base | Representation |
---|---|
bin | 10001001011111101111… |
… | …011100010010110100000 |
3 | 11011220120120210122201102 |
4 | 101023331323202112200 |
5 | 123322323302010302 |
6 | 2302325314453532 |
7 | 151221203152445 |
oct | 21137573422640 |
9 | 4156516718642 |
10 | 1181081281952 |
11 | 415991658220 |
12 | 170a998942a8 |
13 | 874b5c38ca0 |
14 | 41243aab9cc |
15 | 20ac8d59702 |
hex | 112fdee25a0 |
1181081281952 has 192 divisors, whose sum is σ = 2822707077120. Its totient is φ = 479093529600.
The previous prime is 1181081281873. The next prime is 1181081281957. The reversal of 1181081281952 is 2591821801811.
It is a junction number, because it is equal to n+sod(n) for n = 1181081281897 and 1181081281906.
It is not an unprimeable number, because it can be changed into a prime (1181081281957) 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, 164974949 + ... + 164982107.
It is an arithmetic number, because the mean of its divisors is an integer number (14701599360).
Almost surely, 21181081281952 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 1181081281952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1411353538560).
1181081281952 is an abundant number, since it is smaller than the sum of its proper divisors (1641625795168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1181081281952 is a wasteful number, since it uses less digits than its factorization.
1181081281952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8387 (or 8379 counting only the distinct ones).
The product of its (nonzero) digits is 92160, while the sum is 47.
The spelling of 1181081281952 in words is "one trillion, one hundred eighty-one billion, eighty-one million, two hundred eighty-one thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •