Base | Representation |
---|---|
bin | 110100101000110000… |
… | …1110001011101100001 |
3 | 101210202201222101220212 |
4 | 1221101201301131201 |
5 | 3322444430120122 |
6 | 123532314143505 |
7 | 11111106200030 |
oct | 1512141613541 |
9 | 353681871825 |
10 | 113036957537 |
11 | 43a36463279 |
12 | 19aa7a21b95 |
13 | a8757511ba |
14 | 568468a717 |
15 | 2e18a3bce2 |
hex | 1a51871761 |
113036957537 has 8 divisors (see below), whose sum is σ = 129188847936. Its totient is φ = 96886005552.
The previous prime is 113036957519. The next prime is 113036957563. The reversal of 113036957537 is 735759630311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113036957537 - 28 = 113036957281 is a prime.
It is a super-2 number, since 2×1130369575372 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113036951537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45878 + ... + 477680.
It is an arithmetic number, because the mean of its divisors is an integer number (16148605992).
Almost surely, 2113036957537 is an apocalyptic number.
It is an amenable number.
113036957537 is a deficient number, since it is larger than the sum of its proper divisors (16151890399).
113036957537 is an equidigital number, since it uses as much as digits as its factorization.
113036957537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 469207.
The product of its (nonzero) digits is 1786050, while the sum is 50.
The spelling of 113036957537 in words is "one hundred thirteen billion, thirty-six million, nine hundred fifty-seven thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •