Base | Representation |
---|---|
bin | 110100111100100110… |
… | …1111110011100101011 |
3 | 101212111010222120120002 |
4 | 1221321031332130223 |
5 | 3330330412401431 |
6 | 124122342453215 |
7 | 11133443222300 |
oct | 1517115763453 |
9 | 355433876502 |
10 | 113702856491 |
11 | 44248330a94 |
12 | 1a052a3420b |
13 | a9506b0a53 |
14 | 5708ca90a7 |
15 | 2e572253cb |
hex | 1a7937e72b |
113702856491 has 12 divisors (see below), whose sum is σ = 140046976728. Its totient is φ = 91726673472.
The previous prime is 113702856461. The next prime is 113702856503. The reversal of 113702856491 is 194658207311.
It is not a de Polignac number, because 113702856491 - 226 = 113635747627 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113702856461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 68248181 + ... + 68249846.
It is an arithmetic number, because the mean of its divisors is an integer number (11670581394).
It is a 1-persistent number, because it is pandigital, but 2⋅113702856491 = 227405712982 is not.
Almost surely, 2113702856491 is an apocalyptic number.
113702856491 is a deficient number, since it is larger than the sum of its proper divisors (26344120237).
113702856491 is a wasteful number, since it uses less digits than its factorization.
113702856491 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136498058 (or 136498051 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 47.
The spelling of 113702856491 in words is "one hundred thirteen billion, seven hundred two million, eight hundred fifty-six thousand, four hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •