Base | Representation |
---|---|
bin | 110100101000111011… |
… | …0100010001110001101 |
3 | 101210210010012220202210 |
4 | 1221101312202032031 |
5 | 3323002323301031 |
6 | 123533030541033 |
7 | 11111203355466 |
oct | 1512166421615 |
9 | 353703186683 |
10 | 113042400141 |
11 | 43a395403a0 |
12 | 19aa9807779 |
13 | a876908588 |
14 | 56852a5d6d |
15 | 2e19264746 |
hex | 1a51da238d |
113042400141 has 8 divisors (see below), whose sum is σ = 164425309344. Its totient is φ = 68510545520.
The previous prime is 113042400137. The next prime is 113042400169. The reversal of 113042400141 is 141004240311.
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 113042400141 - 22 = 113042400137 is a prime.
It is a super-3 number, since 3×1130424001413 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113042400101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1712763606 + ... + 1712763671.
It is an arithmetic number, because the mean of its divisors is an integer number (20553163668).
Almost surely, 2113042400141 is an apocalyptic number.
113042400141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
113042400141 is a deficient number, since it is larger than the sum of its proper divisors (51382909203).
113042400141 is a wasteful number, since it uses less digits than its factorization.
113042400141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3425527291.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 113042400141 its reverse (141004240311), we get a palindrome (254046640452).
The spelling of 113042400141 in words is "one hundred thirteen billion, forty-two million, four hundred thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •