Base | Representation |
---|---|
bin | 10000000011100011000… |
… | …011111100000000000000 |
3 | 10220110212100021112000000 |
4 | 100003203003330000000 |
5 | 121034100144304000 |
6 | 2202505252000000 |
7 | 142466216336565 |
oct | 20034303740000 |
9 | 3813770245000 |
10 | 1103321088000 |
11 | 395a08a9961a |
12 | 1599b8000000 |
13 | 80072b61cc1 |
14 | 3b5885b286c |
15 | 1da7731c000 |
hex | 100e30fc000 |
1103321088000 has 840 divisors, whose sum is σ = 4134406370640. Its totient is φ = 293820825600.
The previous prime is 1103321087989. The next prime is 1103321088029. The reversal of 1103321088000 is 8801233011.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 1492991631 + ... + 1492992369.
It is an arithmetic number, because the mean of its divisors is an integer number (4921912346).
Almost surely, 21103321088000 is an apocalyptic number.
1103321088000 is a gapful number since it is divisible by the number (10) 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 1103321088000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2067203185320).
1103321088000 is an abundant number, since it is smaller than the sum of its proper divisors (3031085282640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1103321088000 is an frugal number, since it uses more digits than its factorization.
1103321088000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 800 (or 749 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 27.
The spelling of 1103321088000 in words is "one trillion, one hundred three billion, three hundred twenty-one million, eighty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •