Base | Representation |
---|---|
bin | 110100101101101001… |
… | …0001100111001000111 |
3 | 101211012010222201200101 |
4 | 1221123102030321013 |
5 | 3323313331212001 |
6 | 124000442424531 |
7 | 11115134426002 |
oct | 1513322147107 |
9 | 354163881611 |
10 | 113200647751 |
11 | 4400a8a6144 |
12 | 19b32802147 |
13 | a8a0634509 |
14 | 569c2da539 |
15 | 2e280c2a01 |
hex | 1a5b48ce47 |
113200647751 has 4 divisors (see below), whose sum is σ = 119158576600. Its totient is φ = 107242718904.
The previous prime is 113200647709. The next prime is 113200647797. The reversal of 113200647751 is 157746002311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 157746002311 = 41 ⋅3847463471.
It is a cyclic number.
It is not a de Polignac number, because 113200647751 - 29 = 113200647239 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 113200647751.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113200647701) 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 3 ways as a sum of consecutive naturals, for example, 2978964396 + ... + 2978964433.
It is an arithmetic number, because the mean of its divisors is an integer number (29789644150).
Almost surely, 2113200647751 is an apocalyptic number.
113200647751 is a deficient number, since it is larger than the sum of its proper divisors (5957928849).
113200647751 is an equidigital number, since it uses as much as digits as its factorization.
113200647751 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5957928848.
The product of its (nonzero) digits is 35280, while the sum is 37.
The spelling of 113200647751 in words is "one hundred thirteen billion, two hundred million, six hundred forty-seven thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •