Base | Representation |
---|---|
bin | 1111011001111010… |
… | …0111001110010001 |
3 | 101200012010221120111 |
4 | 3312132213032101 |
5 | 31432104020423 |
6 | 1522200041321 |
7 | 204321535213 |
oct | 36636471621 |
9 | 11605127514 |
10 | 4135220113 |
11 | 1832251092 |
12 | 974a63241 |
13 | 50b94720b |
14 | 2b32b25b3 |
15 | 19308560d |
hex | f67a7391 |
4135220113 has 16 divisors (see below), whose sum is σ = 4370818320. Its totient is φ = 3906249984.
The previous prime is 4135220093. The next prime is 4135220153. The reversal of 4135220113 is 3110225314.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 427993344 + 3707226769 = 20688^2 + 60887^2 .
It is a cyclic number.
It is not a de Polignac number, because 4135220113 - 29 = 4135219601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4135220153) 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 15 ways as a sum of consecutive naturals, for example, 569695 + ... + 576907.
It is an arithmetic number, because the mean of its divisors is an integer number (273176145).
Almost surely, 24135220113 is an apocalyptic number.
It is an amenable number.
4135220113 is a deficient number, since it is larger than the sum of its proper divisors (235598207).
4135220113 is a wasteful number, since it uses less digits than its factorization.
4135220113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7668.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 4135220113 is about 64305.6771444015. The cubic root of 4135220113 is about 1605.0905721671.
Adding to 4135220113 its reverse (3110225314), we get a palindrome (7245445427).
The spelling of 4135220113 in words is "four billion, one hundred thirty-five million, two hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •