Base | Representation |
---|---|
bin | 11001101110001000011100… |
… | …001110111100000010000000 |
3 | 112211112021220110011111002110 |
4 | 121232020130032330002000 |
5 | 104311334432003220000 |
6 | 1040331115033415320 |
7 | 32553513551500461 |
oct | 3156103416740200 |
9 | 484467813144073 |
10 | 113121322320000 |
11 | 33053535423635 |
12 | 1082b805b6a540 |
13 | 4b173aac39a97 |
14 | 1dd115ba30d68 |
15 | d1282a05a850 |
hex | 66e21c3bc080 |
113121322320000 has 160 divisors (see below), whose sum is σ = 375477949907280. Its totient is φ = 30165685888000.
The previous prime is 113121322319981. The next prime is 113121322320011. The reversal of 113121322320000 is 23223121311.
It is a tau number, because it is divible by the number of its divisors (160).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 235429422 + ... + 235909421.
Almost surely, 2113121322320000 is an apocalyptic number.
113121322320000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113121322320000 is an abundant number, since it is smaller than the sum of its proper divisors (262356627587280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113121322320000 is an frugal number, since it uses more digits than its factorization.
113121322320000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 471338880 (or 471338853 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 113121322320000 its reverse (23223121311), we get a palindrome (113144545441311).
The spelling of 113121322320000 in words is "one hundred thirteen trillion, one hundred twenty-one billion, three hundred twenty-two million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •