Base | Representation |
---|---|
bin | 10000100000001101111… |
… | …101001001100101100000 |
3 | 11000102022202120200100102 |
4 | 100200031331021211200 |
5 | 122040122002000000 |
6 | 2225000104441532 |
7 | 144636122460104 |
oct | 20401575114540 |
9 | 4012282520312 |
10 | 1134105500000 |
11 | 3a7a75a96a30 |
12 | 1639697792a8 |
13 | 82c3a8acac5 |
14 | 3cc68c89904 |
15 | 1e779c3e3d5 |
hex | 1080df49960 |
1134105500000 has 336 divisors, whose sum is σ = 3127496530032. Its totient is φ = 401184000000.
The previous prime is 1134105499981. The next prime is 1134105500039. The reversal of 1134105500000 is 55014311.
It is a Harshad number since it is a multiple of its sum of digits (20).
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, 203497214 + ... + 203502786.
It is an arithmetic number, because the mean of its divisors is an integer number (9308025387).
Almost surely, 21134105500000 is an apocalyptic number.
1134105500000 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 1134105500000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1563748265016).
1134105500000 is an abundant number, since it is smaller than the sum of its proper divisors (1993391030032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1134105500000 is an frugal number, since it uses more digits than its factorization.
1134105500000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5661 (or 5628 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 20.
The spelling of 1134105500000 in words is "one trillion, one hundred thirty-four billion, one hundred five million, five hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •