Base | Representation |
---|---|
bin | 1111000110110111… |
… | …0000110001010101 |
3 | 101110121202212001122 |
4 | 3301231300301111 |
5 | 31301124232201 |
6 | 1510223133325 |
7 | 202331345345 |
oct | 36155606125 |
9 | 11417685048 |
10 | 4055305301 |
11 | 17a1128993 |
12 | 952144245 |
13 | 4c8216848 |
14 | 2a682cd25 |
15 | 18b04be1b |
hex | f1b70c55 |
4055305301 has 8 divisors (see below), whose sum is σ = 4070064024. Its totient is φ = 4040565760.
The previous prime is 4055305279. The next prime is 4055305321. The reversal of 4055305301 is 1035035504.
It can be written as a sum of positive squares in 4 ways, for example, as 880546276 + 3174759025 = 29674^2 + 56345^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4055305301 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 (4055305321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 518915 + ... + 526671.
It is an arithmetic number, because the mean of its divisors is an integer number (508758003).
Almost surely, 24055305301 is an apocalyptic number.
It is an amenable number.
4055305301 is a deficient number, since it is larger than the sum of its proper divisors (14758723).
4055305301 is a wasteful number, since it uses less digits than its factorization.
4055305301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9591.
The product of its (nonzero) digits is 4500, while the sum is 26.
The square root of 4055305301 is about 63681.2790465141. The cubic root of 4055305301 is about 1594.6835653352.
The spelling of 4055305301 in words is "four billion, fifty-five million, three hundred five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •