Base | Representation |
---|---|
bin | 1001011010100001… |
… | …0001101001001001 |
3 | 20112010021000221112 |
4 | 2112220101221021 |
5 | 20133421443200 |
6 | 1054433220105 |
7 | 116424224225 |
oct | 22650215111 |
9 | 6463230845 |
10 | 2527140425 |
11 | 1087561007 |
12 | 5a6401635 |
13 | 313742984 |
14 | 19d8b7785 |
15 | ebcdc535 |
hex | 96a11a49 |
2527140425 has 12 divisors (see below), whose sum is σ = 3171411600. Its totient is φ = 1997352720.
The previous prime is 2527140409. The next prime is 2527140431. The reversal of 2527140425 is 5240417252.
It is not a de Polignac number, because 2527140425 - 24 = 2527140409 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2527140391 and 2527140400.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 606875 + ... + 611024.
It is an arithmetic number, because the mean of its divisors is an integer number (264284300).
Almost surely, 22527140425 is an apocalyptic number.
2527140425 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2527140425 is a deficient number, since it is larger than the sum of its proper divisors (644271175).
2527140425 is a wasteful number, since it uses less digits than its factorization.
2527140425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1217992 (or 1217987 counting only the distinct ones).
The product of its (nonzero) digits is 22400, while the sum is 32.
The square root of 2527140425 is about 50270.6716187480. The cubic root of 2527140425 is about 1362.1025050378.
Adding to 2527140425 its reverse (5240417252), we get a palindrome (7767557677).
The spelling of 2527140425 in words is "two billion, five hundred twenty-seven million, one hundred forty thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •