Base | Representation |
---|---|
bin | 1001011101101001… |
… | …0010100101111001 |
3 | 20120000221010222101 |
4 | 2113122102211321 |
5 | 20200301022023 |
6 | 1100022223401 |
7 | 116643532042 |
oct | 22732224571 |
9 | 6500833871 |
10 | 2540251513 |
11 | 10939a6618 |
12 | 5aa884b61 |
13 | 316383607 |
14 | 1a152b8c9 |
15 | ed02c1ad |
hex | 97692979 |
2540251513 has 4 divisors (see below), whose sum is σ = 2549910528. Its totient is φ = 2530592500.
The previous prime is 2540251501. The next prime is 2540251541. The reversal of 2540251513 is 3151520452.
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 a de Polignac number, because none of the positive numbers 2k-2540251513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2540251543) 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, 4829113 + ... + 4829638.
It is an arithmetic number, because the mean of its divisors is an integer number (637477632).
Almost surely, 22540251513 is an apocalyptic number.
It is an amenable number.
2540251513 is a deficient number, since it is larger than the sum of its proper divisors (9659015).
2540251513 is an equidigital number, since it uses as much as digits as its factorization.
2540251513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9659014.
The product of its (nonzero) digits is 6000, while the sum is 28.
The square root of 2540251513 is about 50400.9078588868. The cubic root of 2540251513 is about 1364.4540232628.
Adding to 2540251513 its reverse (3151520452), we get a palindrome (5691771965).
The spelling of 2540251513 in words is "two billion, five hundred forty million, two hundred fifty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •