Base | Representation |
---|---|
bin | 101100000111000… |
… | …100010011000001 |
3 | 1220120112102220110 |
4 | 230013010103001 |
5 | 3003423100423 |
6 | 201233501533 |
7 | 24224215335 |
oct | 5407042301 |
9 | 1816472813 |
10 | 740050113 |
11 | 34a814670 |
12 | 187a118a9 |
13 | ba42299a |
14 | 704017c5 |
15 | 44e84193 |
hex | 2c1c44c1 |
740050113 has 8 divisors (see below), whose sum is σ = 1076436576. Its totient is φ = 448515200.
The previous prime is 740050099. The next prime is 740050127. The reversal of 740050113 is 311050047.
It is an interprime number because it is at equal distance from previous prime (740050099) and next prime (740050127).
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 740050113 - 28 = 740049857 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 740050113.
It is not an unprimeable number, because it can be changed into a prime (740050153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11212848 + ... + 11212913.
It is an arithmetic number, because the mean of its divisors is an integer number (134554572).
Almost surely, 2740050113 is an apocalyptic number.
It is an amenable number.
740050113 is a deficient number, since it is larger than the sum of its proper divisors (336386463).
740050113 is a wasteful number, since it uses less digits than its factorization.
740050113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22425775.
The product of its (nonzero) digits is 420, while the sum is 21.
The square root of 740050113 is about 27203.8620971361. The cubic root of 740050113 is about 904.5245869458.
The spelling of 740050113 in words is "seven hundred forty million, fifty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •