Base | Representation |
---|---|
bin | 110100101000100011… |
… | …1010110111101010001 |
3 | 101210202020221121120011 |
4 | 1221101013112331101 |
5 | 3322441142030413 |
6 | 123531505514521 |
7 | 11110663300405 |
oct | 1512107267521 |
9 | 353666847504 |
10 | 113030033233 |
11 | 43a32563a07 |
12 | 19aa5642a41 |
13 | a874198590 |
14 | 56837a7105 |
15 | 2e1812033d |
hex | 1a511d6f51 |
113030033233 has 8 divisors (see below), whose sum is σ = 127017027648. Its totient is φ = 99799092624.
The previous prime is 113030033213. The next prime is 113030033293. The reversal of 113030033233 is 332330030311.
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 113030033233 - 29 = 113030032721 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113030033203) 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, 189013135 + ... + 189013732.
It is an arithmetic number, because the mean of its divisors is an integer number (15877128456).
Almost surely, 2113030033233 is an apocalyptic number.
113030033233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
113030033233 is a deficient number, since it is larger than the sum of its proper divisors (13986994415).
113030033233 is a wasteful number, since it uses less digits than its factorization.
113030033233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 378026903.
The product of its (nonzero) digits is 1458, while the sum is 22.
Adding to 113030033233 its reverse (332330030311), we get a palindrome (445360063544).
The spelling of 113030033233 in words is "one hundred thirteen billion, thirty million, thirty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •