Base | Representation |
---|---|
bin | 11001101111100101011110… |
… | …000100110010011000111010 |
3 | 112211212211201212201111122112 |
4 | 121233211132010302120322 |
5 | 104320004020032000010 |
6 | 1040445034551052322 |
7 | 32563651106133212 |
oct | 3157453604623072 |
9 | 484784655644575 |
10 | 113221211203130 |
11 | 33091934064a08 |
12 | 108470426710a2 |
13 | 4b239397129a4 |
14 | 1dd5d16009242 |
15 | d15224646a05 |
hex | 66f95e13263a |
113221211203130 has 8 divisors (see below), whose sum is σ = 203798180165652. Its totient is φ = 45288484481248.
The previous prime is 113221211203117. The next prime is 113221211203159. The reversal of 113221211203130 is 31302112122311.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 112688861481001 + 532349722129 = 10615501^2 + 729623^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 113221211203096 and 113221211203105.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5661060560147 + ... + 5661060560166.
Almost surely, 2113221211203130 is an apocalyptic number.
113221211203130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
113221211203130 is a deficient number, since it is larger than the sum of its proper divisors (90576968962522).
113221211203130 is a wasteful number, since it uses less digits than its factorization.
113221211203130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11322121120320.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 113221211203130 its reverse (31302112122311), we get a palindrome (144523323325441).
The spelling of 113221211203130 in words is "one hundred thirteen trillion, two hundred twenty-one billion, two hundred eleven million, two hundred three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •