Base | Representation |
---|---|
bin | 11001101111100110001110… |
… | …111100111010010111010110 |
3 | 112211212220212000201210101022 |
4 | 121233212032330322113112 |
5 | 104320012204443102410 |
6 | 1040445252203001142 |
7 | 32564010324155360 |
oct | 3157461674722726 |
9 | 484786760653338 |
10 | 113222031222230 |
11 | 33092214a29447 |
12 | 108472312091b2 |
13 | 4b23a3a5848a8 |
14 | 1dd5d92ca5d30 |
15 | d15271625455 |
hex | 66f98ef3a5d6 |
113222031222230 has 64 divisors (see below), whose sum is σ = 233877194933760. Its totient is φ = 38658478560000.
The previous prime is 113222031222211. The next prime is 113222031222241. The reversal of 113222031222230 is 32222130222311.
It is a self number, because there is not a number n which added to its sum of digits gives 113222031222230.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 116514770 + ... + 117482490.
It is an arithmetic number, because the mean of its divisors is an integer number (3654331170840).
Almost surely, 2113222031222230 is an apocalyptic number.
113222031222230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
113222031222230 is an abundant number, since it is smaller than the sum of its proper divisors (120655163711530).
113222031222230 is a wasteful number, since it uses less digits than its factorization.
113222031222230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 974645.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 113222031222230 its reverse (32222130222311), we get a palindrome (145444161444541).
The spelling of 113222031222230 in words is "one hundred thirteen trillion, two hundred twenty-two billion, thirty-one million, two hundred twenty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •