Base | Representation |
---|---|
bin | 110100101101101000… |
… | …0100101001111100011 |
3 | 101211012010012011022101 |
4 | 1221123100211033203 |
5 | 3323313224120303 |
6 | 124000425351231 |
7 | 11115131010154 |
oct | 1513320451743 |
9 | 354163164271 |
10 | 113200223203 |
11 | 4400a636181 |
12 | 19b32638517 |
13 | a8a05161c2 |
14 | 569c22992b |
15 | 2e2803bd1d |
hex | 1a5b4253e3 |
113200223203 has 8 divisors (see below), whose sum is σ = 119863532160. Its totient is φ = 106537411200.
The previous prime is 113200223183. The next prime is 113200223261. The reversal of 113200223203 is 302322002311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 113200223203 - 233 = 104610288611 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113200233203) 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 7 ways as a sum of consecutive naturals, for example, 410553 + ... + 628453.
It is an arithmetic number, because the mean of its divisors is an integer number (14982941520).
Almost surely, 2113200223203 is an apocalyptic number.
113200223203 is a deficient number, since it is larger than the sum of its proper divisors (6663308957).
113200223203 is a wasteful number, since it uses less digits than its factorization.
113200223203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248477.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 113200223203 its reverse (302322002311), we get a palindrome (415522225514).
It can be divided in two parts, 11320022 and 3203, that added together give a square (11323225 = 33652).
The spelling of 113200223203 in words is "one hundred thirteen billion, two hundred million, two hundred twenty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •