Base | Representation |
---|---|
bin | 110100110100010111… |
… | …0010001111000100010 |
3 | 101211202212020111112101 |
4 | 1221220232101320202 |
5 | 3324244041041114 |
6 | 124035055121014 |
7 | 11123543021164 |
oct | 1515056217042 |
9 | 354685214471 |
10 | 113426112034 |
11 | 441160a0864 |
12 | 19b9621316a |
13 | a908266131 |
14 | 56c022a934 |
15 | 2e3ccabd74 |
hex | 1a68b91e22 |
113426112034 has 8 divisors (see below), whose sum is σ = 171182967120. Its totient is φ = 56365122996.
The previous prime is 113426112031. The next prime is 113426112053. The reversal of 113426112034 is 430211624311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1134261120343 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 113426111993 and 113426112011.
It is not an unprimeable number, because it can be changed into a prime (113426112031) 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 3 ways as a sum of consecutive naturals, for example, 173966104 + ... + 173966755.
It is an arithmetic number, because the mean of its divisors is an integer number (21397870890).
Almost surely, 2113426112034 is an apocalyptic number.
113426112034 is a deficient number, since it is larger than the sum of its proper divisors (57756855086).
113426112034 is a wasteful number, since it uses less digits than its factorization.
113426112034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 347933024.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 113426112034 its reverse (430211624311), we get a palindrome (543637736345).
The spelling of 113426112034 in words is "one hundred thirteen billion, four hundred twenty-six million, one hundred twelve thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •