Base | Representation |
---|---|
bin | 1111011100001010… |
… | …1011011100110101 |
3 | 101200211221021201011 |
4 | 3313002223130311 |
5 | 31442014041423 |
6 | 1523134432221 |
7 | 204465103312 |
oct | 36702533465 |
9 | 11624837634 |
10 | 4144674613 |
11 | 1837619422 |
12 | 978062671 |
13 | 5108a76b1 |
14 | 2b4653d09 |
15 | 193d01b0d |
hex | f70ab735 |
4144674613 has 4 divisors (see below), whose sum is σ = 4388479020. Its totient is φ = 3900870208.
The previous prime is 4144674607. The next prime is 4144674641. The reversal of 4144674613 is 3164764414.
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 2161041169 + 1983633444 = 46487^2 + 44538^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4144674613 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 (4144674013) 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, 121902178 + ... + 121902211.
It is an arithmetic number, because the mean of its divisors is an integer number (1097119755).
Almost surely, 24144674613 is an apocalyptic number.
It is an amenable number.
4144674613 is a deficient number, since it is larger than the sum of its proper divisors (243804407).
4144674613 is a wasteful number, since it uses less digits than its factorization.
4144674613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243804406.
The product of its digits is 193536, while the sum is 40.
The square root of 4144674613 is about 64379.1473460157. The cubic root of 4144674613 is about 1606.3128995379.
The spelling of 4144674613 in words is "four billion, one hundred forty-four million, six hundred seventy-four thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •