Base | Representation |
---|---|
bin | 1001010111001011… |
… | …1010110000011101 |
3 | 20111010221101212201 |
4 | 2111302322300131 |
5 | 20121331344203 |
6 | 1053213331501 |
7 | 116164306555 |
oct | 22562726035 |
9 | 6433841781 |
10 | 2513153053 |
11 | 107a6780a4 |
12 | 5a1796b91 |
13 | 310886218 |
14 | 19bab6165 |
15 | ea977e1d |
hex | 95cbac1d |
2513153053 has 4 divisors (see below), whose sum is σ = 2513622748. Its totient is φ = 2512683360.
The previous prime is 2513153039. The next prime is 2513153057. The reversal of 2513153053 is 3503513152.
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 243297604 + 2269855449 = 15598^2 + 47643^2 .
It is a cyclic number.
It is not a de Polignac number, because 2513153053 - 213 = 2513144861 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 (2513153057) 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, 226728 + ... + 237553.
It is an arithmetic number, because the mean of its divisors is an integer number (628405687).
Almost surely, 22513153053 is an apocalyptic number.
It is an amenable number.
2513153053 is a deficient number, since it is larger than the sum of its proper divisors (469695).
2513153053 is an equidigital number, since it uses as much as digits as its factorization.
2513153053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 469694.
The product of its (nonzero) digits is 6750, while the sum is 28.
The square root of 2513153053 is about 50131.3579808088. The cubic root of 2513153053 is about 1359.5848381353.
The spelling of 2513153053 in words is "two billion, five hundred thirteen million, one hundred fifty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •