Base | Representation |
---|---|
bin | 11001101111101110100110… |
… | …010100001011011011100000 |
3 | 112211220210000222210002021010 |
4 | 121233232212110023123200 |
5 | 104320134103330211000 |
6 | 1040453335340300520 |
7 | 32564446030143261 |
oct | 3157564624133340 |
9 | 484823028702233 |
10 | 113231013132000 |
11 | 33096003a94175 |
12 | 10848b19241740 |
13 | 4b2483c36caba |
14 | 1dd65a5b2c968 |
15 | d155e9e2bd50 |
hex | 66fba650b6e0 |
113231013132000 has 192 divisors, whose sum is σ = 374227500838464. Its totient is φ = 29927724646400.
The previous prime is 113231013131927. The next prime is 113231013132007. The reversal of 113231013132000 is 231310132311.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113231013132007) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 40395849 + ... + 43107848.
It is an arithmetic number, because the mean of its divisors is an integer number (1949101566867).
Almost surely, 2113231013132000 is an apocalyptic number.
113231013132000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113231013132000 is an abundant number, since it is smaller than the sum of its proper divisors (260996487706464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113231013132000 is a wasteful number, since it uses less digits than its factorization.
113231013132000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83503838 (or 83503820 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 113231013132000 its reverse (231310132311), we get a palindrome (113462323264311).
The spelling of 113231013132000 in words is "one hundred thirteen trillion, two hundred thirty-one billion, thirteen million, one hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •