Base | Representation |
---|---|
bin | 11001101111011110000001… |
… | …110101011000111111001111 |
3 | 112211212002010001010220111020 |
4 | 121233132001311120333033 |
5 | 104314341134112241421 |
6 | 1040441234045525223 |
7 | 32563246106260566 |
oct | 3157360165307717 |
9 | 484762101126436 |
10 | 113213221212111 |
11 | 33089503a03449 |
12 | 10845592873813 |
13 | 4b22c65295557 |
14 | 1dd5798bc8bdd |
15 | d14e07e76dc6 |
hex | 66f781d58fcf |
113213221212111 has 8 divisors (see below), whose sum is σ = 151823510527920. Its totient is φ = 75039206352192.
The previous prime is 113213221212079. The next prime is 113213221212121. The reversal of 113213221212111 is 111212122312311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113213221212111 - 25 = 113213221212079 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113213221212121) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 109068613366 + ... + 109068614403.
It is an arithmetic number, because the mean of its divisors is an integer number (18977938815990).
Almost surely, 2113213221212111 is an apocalyptic number.
113213221212111 is a deficient number, since it is larger than the sum of its proper divisors (38610289315809).
113213221212111 is a wasteful number, since it uses less digits than its factorization.
113213221212111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218137227945.
The product of its digits is 288, while the sum is 24.
Adding to 113213221212111 its reverse (111212122312311), we get a palindrome (224425343524422).
The spelling of 113213221212111 in words is "one hundred thirteen trillion, two hundred thirteen billion, two hundred twenty-one million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •