Base | Representation |
---|---|
bin | 110100101101101001… |
… | …0100100111110101101 |
3 | 101211012011011202000112 |
4 | 1221123102210332231 |
5 | 3323313342341123 |
6 | 124000444505405 |
7 | 11115135316436 |
oct | 1513322447655 |
9 | 354164152015 |
10 | 113200746413 |
11 | 4400a963287 |
12 | 19b3284b265 |
13 | a8a066a3b1 |
14 | 569c32448d |
15 | 2e280e1d78 |
hex | 1a5b4a4fad |
113200746413 has 8 divisors (see below), whose sum is σ = 113360083200. Its totient is φ = 113041459168.
The previous prime is 113200746403. The next prime is 113200746431. The reversal of 113200746413 is 314647002311.
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 113200746413 - 228 = 112932310957 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113200746413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113200746403) 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, 8146970 + ... + 8160852.
It is an arithmetic number, because the mean of its divisors is an integer number (14170010400).
Almost surely, 2113200746413 is an apocalyptic number.
It is an amenable number.
113200746413 is a deficient number, since it is larger than the sum of its proper divisors (159336787).
113200746413 is a wasteful number, since it uses less digits than its factorization.
113200746413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24771.
The product of its (nonzero) digits is 12096, while the sum is 32.
Adding to 113200746413 its reverse (314647002311), we get a palindrome (427847748724).
The spelling of 113200746413 in words is "one hundred thirteen billion, two hundred million, seven hundred forty-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •