Base | Representation |
---|---|
bin | 1101111101111100… |
… | …1111000001000101 |
3 | 100200022100200211212 |
4 | 3133133033001011 |
5 | 30134333212031 |
6 | 1420020541205 |
7 | 161626166462 |
oct | 33737170105 |
9 | 10608320755 |
10 | 3749507141 |
11 | 1654554236 |
12 | 887851805 |
13 | 479a688a3 |
14 | 277d8a669 |
15 | 16e29512b |
hex | df7cf045 |
3749507141 has 4 divisors (see below), whose sum is σ = 3750595212. Its totient is φ = 3748419072.
The previous prime is 3749507051. The next prime is 3749507159. The reversal of 3749507141 is 1417059473.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 588256516 + 3161250625 = 24254^2 + 56225^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3749507141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3749500141) 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, 538850 + ... + 545763.
It is an arithmetic number, because the mean of its divisors is an integer number (937648803).
Almost surely, 23749507141 is an apocalyptic number.
It is an amenable number.
3749507141 is a deficient number, since it is larger than the sum of its proper divisors (1088071).
3749507141 is a wasteful number, since it uses less digits than its factorization.
3749507141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1088070.
The product of its (nonzero) digits is 105840, while the sum is 41.
The square root of 3749507141 is about 61233.2192604635. The cubic root of 3749507141 is about 1553.5481865502.
The spelling of 3749507141 in words is "three billion, seven hundred forty-nine million, five hundred seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •