Base | Representation |
---|---|
bin | 1111011001111010… |
… | …1010010111110101 |
3 | 101200012011121021021 |
4 | 3312132222113311 |
5 | 31432104424023 |
6 | 1522200221141 |
7 | 204321620632 |
oct | 36636522765 |
9 | 11605147237 |
10 | 4135233013 |
11 | 183225a84a |
12 | 974a6a7b1 |
13 | 50b950052 |
14 | 2b32b7189 |
15 | 19308935d |
hex | f67aa5f5 |
4135233013 has 4 divisors (see below), whose sum is σ = 4159136268. Its totient is φ = 4111329760.
The previous prime is 4135232993. The next prime is 4135233023. The reversal of 4135233013 is 3103325314.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3786925444 + 348307569 = 61538^2 + 18663^2 .
It is a cyclic number.
It is not a de Polignac number, because 4135233013 - 217 = 4135101941 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 (4135233023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11951368 + ... + 11951713.
It is an arithmetic number, because the mean of its divisors is an integer number (1039784067).
Almost surely, 24135233013 is an apocalyptic number.
It is an amenable number.
4135233013 is a deficient number, since it is larger than the sum of its proper divisors (23903255).
4135233013 is a wasteful number, since it uses less digits than its factorization.
4135233013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23903254.
The product of its (nonzero) digits is 3240, while the sum is 25.
The square root of 4135233013 is about 64305.7774465094. Note that the first 3 decimals coincide. The cubic root of 4135233013 is about 1605.0922412154.
Adding to 4135233013 its reverse (3103325314), we get a palindrome (7238558327).
The spelling of 4135233013 in words is "four billion, one hundred thirty-five million, two hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •