Base | Representation |
---|---|
bin | 1001010111001111… |
… | …0001010011100101 |
3 | 20111011100202100222 |
4 | 2111303301103211 |
5 | 20121411021420 |
6 | 1053222214125 |
7 | 116166230144 |
oct | 22563612345 |
9 | 6434322328 |
10 | 2513376485 |
11 | 107a80aa54 |
12 | 5a1884345 |
13 | 310933b29 |
14 | 19bb3375b |
15 | ea9be225 |
hex | 95cf14e5 |
2513376485 has 8 divisors (see below), whose sum is σ = 3020618616. Its totient is φ = 2007656640.
The previous prime is 2513376479. The next prime is 2513376493. The reversal of 2513376485 is 5846733152.
It can be written as a sum of positive squares in 4 ways, for example, as 637360516 + 1876015969 = 25246^2 + 43313^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2513376485 - 24 = 2513376469 is a prime.
It is a super-2 number, since 2×25133764852 = 12634122710701910450, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 376934 + ... + 383543.
It is an arithmetic number, because the mean of its divisors is an integer number (377577327).
Almost surely, 22513376485 is an apocalyptic number.
It is an amenable number.
2513376485 is a deficient number, since it is larger than the sum of its proper divisors (507242131).
2513376485 is an equidigital number, since it uses as much as digits as its factorization.
2513376485 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 761143.
The product of its digits is 604800, while the sum is 44.
The square root of 2513376485 is about 50133.5863967460. The cubic root of 2513376485 is about 1359.6251282611.
The spelling of 2513376485 in words is "two billion, five hundred thirteen million, three hundred seventy-six thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •