Base | Representation |
---|---|
bin | 1111011001111011… |
… | …0101001010100101 |
3 | 101200012020211220121 |
4 | 3312132311022211 |
5 | 31432112332341 |
6 | 1522201201541 |
7 | 204322163545 |
oct | 36636651245 |
9 | 11605224817 |
10 | 4135277221 |
11 | 183228aa89 |
12 | 974a902b1 |
13 | 50b9671ca |
14 | 2b32c9325 |
15 | 1930974d1 |
hex | f67b52a5 |
4135277221 has 8 divisors (see below), whose sum is σ = 4196543040. Its totient is φ = 4074340512.
The previous prime is 4135277219. The next prime is 4135277227. The reversal of 4135277221 is 1227725314.
4135277221 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 4135277221 - 21 = 4135277219 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 (4135277227) 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, 56905 + ... + 107278.
It is an arithmetic number, because the mean of its divisors is an integer number (524567880).
Almost surely, 24135277221 is an apocalyptic number.
It is an amenable number.
4135277221 is a deficient number, since it is larger than the sum of its proper divisors (61265819).
4135277221 is a wasteful number, since it uses less digits than its factorization.
4135277221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164555.
The product of its digits is 23520, while the sum is 34.
The square root of 4135277221 is about 64306.1211783140. The cubic root of 4135277221 is about 1605.0979609790.
The spelling of 4135277221 in words is "four billion, one hundred thirty-five million, two hundred seventy-seven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •