Base | Representation |
---|---|
bin | 111011110110111… |
… | …000010001001101 |
3 | 2120222122210001001 |
4 | 323312320101031 |
5 | 4024041220442 |
6 | 243352220301 |
7 | 33612626143 |
oct | 7366702115 |
9 | 2528583031 |
10 | 1004241997 |
11 | 475960970 |
12 | 24039a691 |
13 | 130093c45 |
14 | 97533593 |
15 | 5d26d2b7 |
hex | 3bdb844d |
1004241997 has 8 divisors (see below), whose sum is σ = 1118846592. Its totient is φ = 893522400.
The previous prime is 1004241967. The next prime is 1004242013. The reversal of 1004241997 is 7991424001.
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 1004241997 - 211 = 1004239949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1004241967) 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, 970704 + ... + 971737.
It is an arithmetic number, because the mean of its divisors is an integer number (139855824).
Almost surely, 21004241997 is an apocalyptic number.
It is an amenable number.
1004241997 is a deficient number, since it is larger than the sum of its proper divisors (114604595).
1004241997 is a wasteful number, since it uses less digits than its factorization.
1004241997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1942499.
The product of its (nonzero) digits is 18144, while the sum is 37.
The square root of 1004241997 is about 31689.7774842298. Note that the first 3 decimals coincide. The cubic root of 1004241997 is about 1001.4120043054.
Adding to 1004241997 its reverse (7991424001), we get a palindrome (8995665998).
The spelling of 1004241997 in words is "one billion, four million, two hundred forty-one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •