Base | Representation |
---|---|
bin | 1111000110011011… |
… | …1000010100011101 |
3 | 101110111101012022120 |
4 | 3301212320110131 |
5 | 31300144014323 |
6 | 1510120333153 |
7 | 202310122536 |
oct | 36146702435 |
9 | 11414335276 |
10 | 4053501213 |
11 | 17a0106503 |
12 | 9516141b9 |
13 | 4c7a34638 |
14 | 2a64bd68d |
15 | 18ace25e3 |
hex | f19b851d |
4053501213 has 4 divisors (see below), whose sum is σ = 5404668288. Its totient is φ = 2702334140.
The previous prime is 4053501191. The next prime is 4053501241. The reversal of 4053501213 is 3121053504.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4053501213 - 210 = 4053500189 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4053501313) 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 3 ways as a sum of consecutive naturals, for example, 675583533 + ... + 675583538.
It is an arithmetic number, because the mean of its divisors is an integer number (1351167072).
Almost surely, 24053501213 is an apocalyptic number.
It is an amenable number.
4053501213 is a deficient number, since it is larger than the sum of its proper divisors (1351167075).
4053501213 is a wasteful number, since it uses less digits than its factorization.
4053501213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1351167074.
The product of its (nonzero) digits is 1800, while the sum is 24.
The square root of 4053501213 is about 63667.1124914583. The cubic root of 4053501213 is about 1594.4470540658.
Adding to 4053501213 its reverse (3121053504), we get a palindrome (7174554717).
The spelling of 4053501213 in words is "four billion, fifty-three million, five hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •