Base | Representation |
---|---|
bin | 110100110010000111… |
… | …1111011000001110010 |
3 | 101211120121222201020112 |
4 | 1221210033323001302 |
5 | 3324120331421414 |
6 | 124023414141322 |
7 | 11121641662430 |
oct | 1514417730162 |
9 | 354517881215 |
10 | 113351045234 |
11 | 44087789a89 |
12 | 19b75051842 |
13 | a8c58422cb |
14 | 56b4289d50 |
15 | 2e363ced3e |
hex | 1a643fb072 |
113351045234 has 32 divisors (see below), whose sum is σ = 204822641280. Its totient is φ = 45959363712.
The previous prime is 113351045233. The next prime is 113351045243. The reversal of 113351045234 is 432540153311.
It is a super-2 number, since 2×1133510452342 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 113351045234.
It is not an unprimeable number, because it can be changed into a prime (113351045233) 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 15 ways as a sum of consecutive naturals, for example, 95699 + ... + 485654.
It is an arithmetic number, because the mean of its divisors is an integer number (6400707540).
Almost surely, 2113351045234 is an apocalyptic number.
113351045234 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
113351045234 is a deficient number, since it is larger than the sum of its proper divisors (91471596046).
113351045234 is a wasteful number, since it uses less digits than its factorization.
113351045234 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 582114.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 113351045234 its reverse (432540153311), we get a palindrome (545891198545).
The spelling of 113351045234 in words is "one hundred thirteen billion, three hundred fifty-one million, forty-five thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •