Base | Representation |
---|---|
bin | 110100101000111101… |
… | …0011001010101001101 |
3 | 101210210012010100012012 |
4 | 1221101322121111031 |
5 | 3323003103143201 |
6 | 123533104351005 |
7 | 11111215102421 |
oct | 1512172312515 |
9 | 353705110165 |
10 | 113043412301 |
11 | 43a3a071896 |
12 | 19aaa015465 |
13 | a876ba11a1 |
14 | 568548ab81 |
15 | 2e193b45bb |
hex | 1a51e9954d |
113043412301 has 16 divisors (see below), whose sum is σ = 121880640000. Its totient is φ = 104521066416.
The previous prime is 113043412289. The next prime is 113043412331. The reversal of 113043412301 is 103214340311.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113043412301 is a prime.
It is a super-3 number, since 3×1130434123013 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113043412331) 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, 206921 + ... + 518558.
It is an arithmetic number, because the mean of its divisors is an integer number (7617540000).
Almost surely, 2113043412301 is an apocalyptic number.
It is an amenable number.
113043412301 is a deficient number, since it is larger than the sum of its proper divisors (8837227699).
113043412301 is a wasteful number, since it uses less digits than its factorization.
113043412301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 725696.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 113043412301 its reverse (103214340311), we get a palindrome (216257752612).
The spelling of 113043412301 in words is "one hundred thirteen billion, forty-three million, four hundred twelve thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •