Base | Representation |
---|---|
bin | 10000000111111100000… |
… | …110001101011000000000 |
3 | 10220221000221100222200000 |
4 | 100013330012031120000 |
5 | 121123224214044102 |
6 | 2205005202400000 |
7 | 143024111201400 |
oct | 20077406153000 |
9 | 3827027328600 |
10 | 1108036081152 |
11 | 397a08532780 |
12 | 15a8b3060000 |
13 | 80644942290 |
14 | 3b8b4884800 |
15 | 1dc5122701c |
hex | 101fc18d600 |
1108036081152 has 2880 divisors, whose sum is σ = 4792481261568. Its totient is φ = 250822656000.
The previous prime is 1108036081133. The next prime is 1108036081211. The reversal of 1108036081152 is 2511806308011.
It is a super-3 number, since 3×11080360811523 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 287 ways as a sum of consecutive naturals, for example, 27025270252 + ... + 27025270292.
Almost surely, 21108036081152 is an apocalyptic number.
1108036081152 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 1108036081152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2396240630784).
1108036081152 is an abundant number, since it is smaller than the sum of its proper divisors (3684445180416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1108036081152 is a wasteful number, since it uses less digits than its factorization.
1108036081152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143 (or 108 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 36.
The spelling of 1108036081152 in words is "one trillion, one hundred eight billion, thirty-six million, eighty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •