Base | Representation |
---|---|
bin | 1001001110111100… |
… | …1110010101100010 |
3 | 20101201222110111002 |
4 | 2103233032111202 |
5 | 20034012131432 |
6 | 1045541352002 |
7 | 115265003144 |
oct | 22357162542 |
9 | 6351873432 |
10 | 2478630242 |
11 | 1062138650 |
12 | 592108602 |
13 | 30668971a |
14 | 19728ac94 |
15 | e7908e62 |
hex | 93bce562 |
2478630242 has 16 divisors (see below), whose sum is σ = 4101516000. Its totient is φ = 1113990240.
The previous prime is 2478630241. The next prime is 2478630251. The reversal of 2478630242 is 2420368742.
It is a super-2 number, since 2×24786302422 = 12287215753113957128, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2478630196 and 2478630205.
It is not an unprimeable number, because it can be changed into a prime (2478630241) 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 7 ways as a sum of consecutive naturals, for example, 630992 + ... + 634907.
It is an arithmetic number, because the mean of its divisors is an integer number (256344750).
Almost surely, 22478630242 is an apocalyptic number.
2478630242 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2478630242 is a deficient number, since it is larger than the sum of its proper divisors (1622885758).
2478630242 is a wasteful number, since it uses less digits than its factorization.
2478630242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1266001.
The product of its (nonzero) digits is 129024, while the sum is 38.
The square root of 2478630242 is about 49785.8437911822. The cubic root of 2478630242 is about 1353.3306406449.
Adding to 2478630242 its reverse (2420368742), we get a palindrome (4898998984).
The spelling of 2478630242 in words is "two billion, four hundred seventy-eight million, six hundred thirty thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •