Base | Representation |
---|---|
bin | 10000100000011100000… |
… | …111001000111111000000 |
3 | 11000102221022110221002201 |
4 | 100200130013020333000 |
5 | 122041113302000000 |
6 | 2225035431122544 |
7 | 144645035260660 |
oct | 20403407107700 |
9 | 4012838427081 |
10 | 1134343000000 |
11 | 3a8088062221 |
12 | 163a15213454 |
13 | 82c77b66a52 |
14 | 3cc8c6301a0 |
15 | 1e790a0496a |
hex | 1081c1c8fc0 |
1134343000000 has 392 divisors, whose sum is σ = 3231791132544. Its totient is φ = 386966400000.
The previous prime is 1134342999997. The next prime is 1134343000001. The reversal of 1134343000000 is 3434311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1134343000001) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 2428999767 + ... + 2429000233.
Almost surely, 21134343000000 is an apocalyptic number.
1134343000000 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 1134343000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1615895566272).
1134343000000 is an abundant number, since it is smaller than the sum of its proper divisors (2097448132544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1134343000000 is an frugal number, since it uses more digits than its factorization.
1134343000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 863 (or 828 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 1134343000000 its reverse (3434311), we get a palindrome (1134346434311).
The spelling of 1134343000000 in words is "one trillion, one hundred thirty-four billion, three hundred forty-three million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •