Base | Representation |
---|---|
bin | 110100101101101001… |
… | …0010010101011001101 |
3 | 101211012011000221011122 |
4 | 1221123102102223031 |
5 | 3323313332441222 |
6 | 124000443130325 |
7 | 11115134555030 |
oct | 1513322225315 |
9 | 354164027148 |
10 | 113200671437 |
11 | 4400a911a17 |
12 | 19b328139a5 |
13 | a8a0642229 |
14 | 569c305017 |
15 | 2e280c9a42 |
hex | 1a5b492acd |
113200671437 has 8 divisors (see below), whose sum is σ = 129379740672. Its totient is φ = 97023488400.
The previous prime is 113200671433. The next prime is 113200671439. The reversal of 113200671437 is 734176002311.
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 113200671437 - 22 = 113200671433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113200671397 and 113200671406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113200671433) 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 7 ways as a sum of consecutive naturals, for example, 340514 + ... + 585107.
It is an arithmetic number, because the mean of its divisors is an integer number (16172467584).
Almost surely, 2113200671437 is an apocalyptic number.
It is an amenable number.
113200671437 is a deficient number, since it is larger than the sum of its proper divisors (16179069235).
113200671437 is an equidigital number, since it uses as much as digits as its factorization.
113200671437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 943099.
The product of its (nonzero) digits is 21168, while the sum is 35.
Adding to 113200671437 its reverse (734176002311), we get a palindrome (847376673748).
The spelling of 113200671437 in words is "one hundred thirteen billion, two hundred million, six hundred seventy-one thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •