Base | Representation |
---|---|
bin | 11001101100100010110100… |
… | …000110111010000111010100 |
3 | 112211010212020121112100100110 |
4 | 121230202310012322013110 |
5 | 104303042442001432012 |
6 | 1040205031041243020 |
7 | 32542601461342551 |
oct | 3154426406720724 |
9 | 484125217470313 |
10 | 113012201202132 |
11 | 330112293a16a1 |
12 | 10812631633470 |
13 | 4b0a00a85139b |
14 | 1dc9b6946ba28 |
15 | d0ea901bc73c |
hex | 66c8b41ba1d4 |
113012201202132 has 48 divisors (see below), whose sum is σ = 267416233564032. Its totient is φ = 37139176488960.
The previous prime is 113012201202119. The next prime is 113012201202143. The reversal of 113012201202132 is 231202102210311.
It is a junction number, because it is equal to n+sod(n) for n = 113012201202099 and 113012201202108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30789588 + ... + 34264020.
It is an arithmetic number, because the mean of its divisors is an integer number (5571171532584).
Almost surely, 2113012201202132 is an apocalyptic number.
113012201202132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
113012201202132 is an abundant number, since it is smaller than the sum of its proper divisors (154404032361900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113012201202132 is a wasteful number, since it uses less digits than its factorization.
113012201202132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3512688 (or 3512686 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 113012201202132 its reverse (231202102210311), we get a palindrome (344214303412443).
The spelling of 113012201202132 in words is "one hundred thirteen trillion, twelve billion, two hundred one million, two hundred two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •