Base | Representation |
---|---|
bin | 110100101011000000… |
… | …0110101101100101111 |
3 | 101210221222120122012101 |
4 | 1221112000311230233 |
5 | 3323123211211343 |
6 | 123544003115531 |
7 | 11113011631435 |
oct | 1512600655457 |
9 | 353858518171 |
10 | 113112210223 |
11 | 43a74991781 |
12 | 19b09072ba7 |
13 | a88820b80c |
14 | 5690678d55 |
15 | 2e20453e4d |
hex | 1a56035b2f |
113112210223 has 4 divisors (see below), whose sum is σ = 113115472168. Its totient is φ = 113108948280.
The previous prime is 113112210217. The next prime is 113112210257. The reversal of 113112210223 is 322012211311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 113112210223 - 217 = 113112079151 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113112210223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113112210283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1578393 + ... + 1648498.
It is an arithmetic number, because the mean of its divisors is an integer number (28278868042).
Almost surely, 2113112210223 is an apocalyptic number.
113112210223 is a deficient number, since it is larger than the sum of its proper divisors (3261945).
113112210223 is an equidigital number, since it uses as much as digits as its factorization.
113112210223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3261944.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 113112210223 its reverse (322012211311), we get a palindrome (435124421534).
The spelling of 113112210223 in words is "one hundred thirteen billion, one hundred twelve million, two hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •