Base | Representation |
---|---|
bin | 110100101000111101… |
… | …0001000001100010111 |
3 | 101210210011222202220021 |
4 | 1221101322020030113 |
5 | 3323003043421403 |
6 | 123533103050011 |
7 | 11111214360646 |
oct | 1512172101427 |
9 | 353704882807 |
10 | 113043342103 |
11 | 43a3a02407a |
12 | 19aa9ba0907 |
13 | a876b78253 |
14 | 568546d35d |
15 | 2e1939d8bd |
hex | 1a51e88317 |
113043342103 has 8 divisors (see below), whose sum is σ = 119733895872. Its totient is φ = 106357337856.
The previous prime is 113043342067. The next prime is 113043342107. The reversal of 113043342103 is 301243340311.
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 113043342103 - 213 = 113043333911 is a prime.
It is a super-3 number, since 3×1130433421033 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113043342107) 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, 1086150 + ... + 1185667.
It is an arithmetic number, because the mean of its divisors is an integer number (14966736984).
Almost surely, 2113043342103 is an apocalyptic number.
113043342103 is a deficient number, since it is larger than the sum of its proper divisors (6690553769).
113043342103 is a wasteful number, since it uses less digits than its factorization.
113043342103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2274761.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 113043342103 its reverse (301243340311), we get a palindrome (414286682414).
The spelling of 113043342103 in words is "one hundred thirteen billion, forty-three million, three hundred forty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •