Base | Representation |
---|---|
bin | 110100110100011110… |
… | …1001100000011101101 |
3 | 101211210010121001201012 |
4 | 1221220331030003231 |
5 | 3324301041122313 |
6 | 124035314555005 |
7 | 11123621156510 |
oct | 1515075140355 |
9 | 354703531635 |
10 | 113430020333 |
11 | 44118320163 |
12 | 19b97598a65 |
13 | a909004036 |
14 | 56c0966d77 |
15 | 2e3d2ceda8 |
hex | 1a68f4c0ed |
113430020333 has 8 divisors (see below), whose sum is σ = 131196168768. Its totient is φ = 96054336864.
The previous prime is 113430020323. The next prime is 113430020351. The reversal of 113430020333 is 333020034311.
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 113430020333 - 220 = 113428971757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113430020299 and 113430020308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113430020323) 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, 97615616 + ... + 97616777.
It is an arithmetic number, because the mean of its divisors is an integer number (16399521096).
Almost surely, 2113430020333 is an apocalyptic number.
It is an amenable number.
113430020333 is a deficient number, since it is larger than the sum of its proper divisors (17766148435).
113430020333 is an equidigital number, since it uses as much as digits as its factorization.
113430020333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195232483.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 113430020333 its reverse (333020034311), we get a palindrome (446450054644).
The spelling of 113430020333 in words is "one hundred thirteen billion, four hundred thirty million, twenty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •