Base | Representation |
---|---|
bin | 1111011011000110… |
… | …0111110100100101 |
3 | 101200112112010020000 |
4 | 3312301213310211 |
5 | 31434343001201 |
6 | 1522454531513 |
7 | 204412101363 |
oct | 36661476445 |
9 | 11615463200 |
10 | 4140203301 |
11 | 1835045023 |
12 | 976666b99 |
13 | 50c9a0450 |
14 | 2b3c0c633 |
15 | 19371bd86 |
hex | f6c67d25 |
4140203301 has 20 divisors (see below), whose sum is σ = 6660499692. Its totient is φ = 2547816768.
The previous prime is 4140203281. The next prime is 4140203317. The reversal of 4140203301 is 1033020414.
It can be written as a sum of positive squares in 2 ways, for example, as 2621542401 + 1518660900 = 51201^2 + 38970^2 .
It is not a de Polignac number, because 4140203301 - 25 = 4140203269 is a prime.
It is a super-2 number, since 2×41402033012 = 34282566747222593202, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4140203381) 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 19 ways as a sum of consecutive naturals, for example, 1964856 + ... + 1966961.
Almost surely, 24140203301 is an apocalyptic number.
It is an amenable number.
4140203301 is a deficient number, since it is larger than the sum of its proper divisors (2520296391).
4140203301 is a wasteful number, since it uses less digits than its factorization.
4140203301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3931842 (or 3931833 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 4140203301 is about 64344.4115755207. The cubic root of 4140203301 is about 1605.7350567920.
Adding to 4140203301 its reverse (1033020414), we get a palindrome (5173223715).
The spelling of 4140203301 in words is "four billion, one hundred forty million, two hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •