Base | Representation |
---|---|
bin | 110011101011000011… |
… | …1100101000010000000 |
3 | 101121102110000220221200 |
4 | 1213112013211002000 |
5 | 3304224410241222 |
6 | 122551033021200 |
7 | 11005565426133 |
oct | 1472607450200 |
9 | 347373026850 |
10 | 110966493312 |
11 | 43073768914 |
12 | 1960a554800 |
13 | a605804c3c |
14 | 55296cc21a |
15 | 2d46daaeac |
hex | 19d61e5080 |
110966493312 has 144 divisors (see below), whose sum is σ = 333806477550. Its totient is φ = 35380426752.
The previous prime is 110966493271. The next prime is 110966493329. The reversal of 110966493312 is 213394669011.
It can be written as a sum of positive squares in only one way, i.e., 86563054656 + 24403438656 = 294216^2 + 156216^2 .
It is a tau number, because it is divible by the number of its divisors (144).
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 518364 + ... + 700452.
Almost surely, 2110966493312 is an apocalyptic number.
110966493312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 110966493312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166903238775).
110966493312 is an abundant number, since it is smaller than the sum of its proper divisors (222839984238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110966493312 is a wasteful number, since it uses less digits than its factorization.
110966493312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182155 (or 182117 counting only the distinct ones).
The product of its (nonzero) digits is 209952, while the sum is 45.
The spelling of 110966493312 in words is "one hundred ten billion, nine hundred sixty-six million, four hundred ninety-three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •