Base | Representation |
---|---|
bin | 1110010011101001… |
… | …1000010010001101 |
3 | 100220122121002000122 |
4 | 3210322120102031 |
5 | 30331132242234 |
6 | 1433031234325 |
7 | 164112534305 |
oct | 34472302215 |
9 | 10818532018 |
10 | 3840509069 |
11 | 16a095a341 |
12 | 8b22189a5 |
13 | 49287b897 |
14 | 2860b8605 |
15 | 17726d92e |
hex | e4e9848d |
3840509069 has 8 divisors (see below), whose sum is σ = 3881944248. Its totient is φ = 3799111680.
The previous prime is 3840509051. The next prime is 3840509119. The reversal of 3840509069 is 9609050483.
It can be written as a sum of positive squares in 4 ways, for example, as 316662025 + 3523847044 = 17795^2 + 59362^2 .
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 3840509069 - 28 = 3840508813 is a prime.
It is a super-2 number, since 2×38405090692 = 29499019818142493522, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3840509669) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 226259 + ... + 242639.
It is an arithmetic number, because the mean of its divisors is an integer number (485243031).
Almost surely, 23840509069 is an apocalyptic number.
It is an amenable number.
3840509069 is a deficient number, since it is larger than the sum of its proper divisors (41435179).
3840509069 is a wasteful number, since it uses less digits than its factorization.
3840509069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18895.
The product of its (nonzero) digits is 233280, while the sum is 44.
The square root of 3840509069 is about 61971.8409360251. The cubic root of 3840509069 is about 1566.0162526375.
The spelling of 3840509069 in words is "three billion, eight hundred forty million, five hundred nine thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •