Base | Representation |
---|---|
bin | 111011100111100… |
… | …111100100100010 |
3 | 2120201010112022100 |
4 | 323213213210202 |
5 | 4022030211232 |
6 | 243130351230 |
7 | 33533624544 |
oct | 7347474442 |
9 | 2521115270 |
10 | 1000241442 |
11 | 473679222 |
12 | 23ab8b516 |
13 | 12c2c3055 |
14 | 96bb1694 |
15 | 5cc2cc7c |
hex | 3b9e7922 |
1000241442 has 12 divisors (see below), whose sum is σ = 2167189830. Its totient is φ = 333413808.
The previous prime is 1000241423. The next prime is 1000241449. The reversal of 1000241442 is 2441420001.
It can be written as a sum of positive squares in only one way, i.e., 823058721 + 177182721 = 28689^2 + 13311^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 55568969 = 1000241442 / (1 + 0 + 0 + 0 + 2 + 4 + 1 + 4 + 4 + 2).
It is not an unprimeable number, because it can be changed into a prime (1000241449) 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 5 ways as a sum of consecutive naturals, for example, 27784467 + ... + 27784502.
Almost surely, 21000241442 is an apocalyptic number.
1000241442 is an abundant number, since it is smaller than the sum of its proper divisors (1166948388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000241442 is a wasteful number, since it uses less digits than its factorization.
1000241442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55568977 (or 55568974 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
The square root of 1000241442 is about 31626.5939044975. The cubic root of 1000241442 is about 1000.0804741904.
Adding to 1000241442 its reverse (2441420001), we get a palindrome (3441661443).
The spelling of 1000241442 in words is "one billion, two hundred forty-one thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •