Base | Representation |
---|---|
bin | 11001101100100000111110… |
… | …101111110011001100101110 |
3 | 112211010200011101112012020011 |
4 | 121230200332233303030232 |
5 | 104303024423421211342 |
6 | 1040204103423043434 |
7 | 32542501622235424 |
oct | 3154407657631456 |
9 | 484120141465204 |
10 | 113010232210222 |
11 | 33010408a03956 |
12 | 1081218214057a |
13 | 4b09a85942b09 |
14 | 1dc9a1db65114 |
15 | d0e9c73d2717 |
hex | 66c83ebf332e |
113010232210222 has 8 divisors (see below), whose sum is σ = 169517131077672. Its totient is φ = 56504521851000.
The previous prime is 113010232210207. The next prime is 113010232210223. The reversal of 113010232210222 is 222012232010311.
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 = 113010232210193 and 113010232210202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113010232210223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 296889304 + ... + 297269707.
It is an arithmetic number, because the mean of its divisors is an integer number (21189641384709).
Almost surely, 2113010232210222 is an apocalyptic number.
113010232210222 is a deficient number, since it is larger than the sum of its proper divisors (56506898867450).
113010232210222 is an equidigital number, since it uses as much as digits as its factorization.
113010232210222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 594254114.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 113010232210222 its reverse (222012232010311), we get a palindrome (335022464220533).
It can be divided in two parts, 113010 and 232210222, that added together give a palindrome (232323232).
The spelling of 113010232210222 in words is "one hundred thirteen trillion, ten billion, two hundred thirty-two million, two hundred ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •