Base | Representation |
---|---|
bin | 1110011100001100… |
… | …1010111011011101 |
3 | 101000011001220100122 |
4 | 3213003022323131 |
5 | 30414322234333 |
6 | 1440352004325 |
7 | 165026404463 |
oct | 34703127335 |
9 | 11004056318 |
10 | 3876368093 |
11 | 170a1217a4 |
12 | 9022306a5 |
13 | 49a125640 |
14 | 28ab70833 |
15 | 17a4a3798 |
hex | e70caedd |
3876368093 has 4 divisors (see below), whose sum is σ = 4174550268. Its totient is φ = 3578185920.
The previous prime is 3876368071. The next prime is 3876368107. The reversal of 3876368093 is 3908636783.
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 1829529529 + 2046838564 = 42773^2 + 45242^2 .
It is a cyclic number.
It is not a de Polignac number, because 3876368093 - 226 = 3809259229 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 (3876368003) 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, 149091068 + ... + 149091093.
It is an arithmetic number, because the mean of its divisors is an integer number (1043637567).
Almost surely, 23876368093 is an apocalyptic number.
It is an amenable number.
3876368093 is a deficient number, since it is larger than the sum of its proper divisors (298182175).
3876368093 is a wasteful number, since it uses less digits than its factorization.
3876368093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298182174.
The product of its (nonzero) digits is 3919104, while the sum is 53.
The square root of 3876368093 is about 62260.4858076132. The cubic root of 3876368093 is about 1570.8751517958.
The spelling of 3876368093 in words is "three billion, eight hundred seventy-six million, three hundred sixty-eight thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •