Base | Representation |
---|---|
bin | 1001000101110111… |
… | …0100001110111010 |
3 | 20022002020212200201 |
4 | 2101131310032322 |
5 | 14444232344232 |
6 | 1042100352414 |
7 | 114323004424 |
oct | 22135641672 |
9 | 6262225621 |
10 | 2440512442 |
11 | 1042673135 |
12 | 5813a570a |
13 | 2cb801804 |
14 | 1921a7814 |
15 | e43c9be7 |
hex | 917743ba |
2440512442 has 8 divisors (see below), whose sum is σ = 3673263636. Its totient is φ = 1216091232.
The previous prime is 2440512433. The next prime is 2440512443. The reversal of 2440512442 is 2442150442.
It can be written as a sum of positive squares in 2 ways, for example, as 1795301641 + 645210801 = 42371^2 + 25401^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×24405124422 = 11912201959113606728, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2440512442.
It is not an unprimeable number, because it can be changed into a prime (2440512443) 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, 2081763 + ... + 2082934.
Almost surely, 22440512442 is an apocalyptic number.
2440512442 is a deficient number, since it is larger than the sum of its proper divisors (1232751194).
2440512442 is a wasteful number, since it uses less digits than its factorization.
2440512442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4164992.
The product of its (nonzero) digits is 10240, while the sum is 28.
The square root of 2440512442 is about 49401.5429111278. The cubic root of 2440512442 is about 1346.3573389975.
Adding to 2440512442 its reverse (2442150442), we get a palindrome (4882662884).
The spelling of 2440512442 in words is "two billion, four hundred forty million, five hundred twelve thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •