Base | Representation |
---|---|
bin | 1001000010001110… |
… | …0111000011100001 |
3 | 20021000112200012102 |
4 | 2100203213003201 |
5 | 14431331112423 |
6 | 1040353340145 |
7 | 114046214462 |
oct | 22043470341 |
9 | 6230480172 |
10 | 2425254113 |
11 | 1034aa1347 |
12 | 578267655 |
13 | 2c85bb709 |
14 | 190154d69 |
15 | e2db3c28 |
hex | 908e70e1 |
2425254113 has 8 divisors (see below), whose sum is σ = 2531692800. Its totient is φ = 2318898208.
The previous prime is 2425254109. The next prime is 2425254127. The reversal of 2425254113 is 3114525242.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2425254113 - 22 = 2425254109 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2425254163) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 43448 + ... + 82086.
It is an arithmetic number, because the mean of its divisors is an integer number (316461600).
Almost surely, 22425254113 is an apocalyptic number.
2425254113 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2425254113 is a deficient number, since it is larger than the sum of its proper divisors (106438687).
2425254113 is a wasteful number, since it uses less digits than its factorization.
2425254113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41391.
The product of its digits is 9600, while the sum is 29.
The square root of 2425254113 is about 49246.8690679925. The cubic root of 2425254113 is about 1343.5456173219.
Adding to 2425254113 its reverse (3114525242), we get a palindrome (5539779355).
The spelling of 2425254113 in words is "two billion, four hundred twenty-five million, two hundred fifty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •