Base | Representation |
---|---|
bin | 10000011111010010000… |
… | …110100000011101000000 |
3 | 11000022201210001001100120 |
4 | 100133102012200131000 |
5 | 122031042414220000 |
6 | 2224312313420240 |
7 | 144602210206446 |
oct | 20372206403500 |
9 | 4008653031316 |
10 | 1133101320000 |
11 | 3a7600178701 |
12 | 16372940a680 |
13 | 82b0a83b160 |
14 | 3cbb1770b96 |
15 | 1e71b9d46a0 |
hex | 107d21a0740 |
1133101320000 has 1120 divisors, whose sum is σ = 4219710160512. Its totient is φ = 266416128000.
The previous prime is 1133101319983. The next prime is 1133101320011. The reversal of 1133101320000 is 231013311.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 3867239854 + ... + 3867240146.
Almost surely, 21133101320000 is an apocalyptic number.
1133101320000 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 1133101320000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2109855080256).
1133101320000 is an abundant number, since it is smaller than the sum of its proper divisors (3086608840512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1133101320000 is a wasteful number, since it uses less digits than its factorization.
1133101320000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 445 (or 420 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1133101320000 its reverse (231013311), we get a palindrome (1133332333311).
The spelling of 1133101320000 in words is "one trillion, one hundred thirty-three billion, one hundred one million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •