Base | Representation |
---|---|
bin | 1111000101101011… |
… | …0001101101011011 |
3 | 101110021102000001101 |
4 | 3301122301231123 |
5 | 31243341002121 |
6 | 1505524332231 |
7 | 202241136433 |
oct | 36132615533 |
9 | 11407360041 |
10 | 4050328411 |
11 | 1799339758 |
12 | 950544077 |
13 | 4c719343c |
14 | 2a5cd52c3 |
15 | 18a8b7491 |
hex | f16b1b5b |
4050328411 has 8 divisors (see below), whose sum is σ = 4093495280. Its totient is φ = 4007190528.
The previous prime is 4050328379. The next prime is 4050328433. The reversal of 4050328411 is 1148230504.
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 4050328411 - 25 = 4050328379 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4050328411.
It is not an unprimeable number, because it can be changed into a prime (4050328511) 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 7 ways as a sum of consecutive naturals, for example, 385435 + ... + 395803.
It is an arithmetic number, because the mean of its divisors is an integer number (511686910).
Almost surely, 24050328411 is an apocalyptic number.
4050328411 is a deficient number, since it is larger than the sum of its proper divisors (43166869).
4050328411 is a wasteful number, since it uses less digits than its factorization.
4050328411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14493.
The product of its (nonzero) digits is 3840, while the sum is 28.
The square root of 4050328411 is about 63642.1904949853. The cubic root of 4050328411 is about 1594.0309376419.
Adding to 4050328411 its reverse (1148230504), we get a palindrome (5198558915).
The spelling of 4050328411 in words is "four billion, fifty million, three hundred twenty-eight thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •