Base | Representation |
---|---|
bin | 110100101101101100… |
… | …0100011010000101001 |
3 | 101211012021010021220212 |
4 | 1221123120203100221 |
5 | 3323314242442413 |
6 | 124000542230505 |
7 | 11115154530503 |
oct | 1513330432051 |
9 | 354167107825 |
10 | 113202312233 |
11 | 4401083274a |
12 | 19b33285435 |
13 | a8a0a9800a |
14 | 569c610d73 |
15 | 2e28300ca8 |
hex | 1a5b623429 |
113202312233 has 8 divisors (see below), whose sum is σ = 113916105216. Its totient is φ = 112489781200.
The previous prime is 113202312217. The next prime is 113202312247. The reversal of 113202312233 is 332213202311.
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 113202312233 - 24 = 113202312217 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113202312199 and 113202312208.
It is not an unprimeable number, because it can be changed into a prime (113202312263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 135191 + ... + 494652.
It is an arithmetic number, because the mean of its divisors is an integer number (14239513152).
Almost surely, 2113202312233 is an apocalyptic number.
It is an amenable number.
113202312233 is a deficient number, since it is larger than the sum of its proper divisors (713792983).
113202312233 is an equidigital number, since it uses as much as digits as its factorization.
113202312233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 630975.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 113202312233 its reverse (332213202311), we get a palindrome (445415514544).
The spelling of 113202312233 in words is "one hundred thirteen billion, two hundred two million, three hundred twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •