Base | Representation |
---|---|
bin | 111011110110011… |
… | …000010100011011 |
3 | 2120222102010112011 |
4 | 323312120110123 |
5 | 4024023024011 |
6 | 243345330351 |
7 | 33611542462 |
oct | 7366302433 |
9 | 2528363464 |
10 | 1004111131 |
11 | 475881611 |
12 | 2403369b7 |
13 | 1300494ca |
14 | 974db9d9 |
15 | 5d244621 |
hex | 3bd9851b |
1004111131 has 8 divisors (see below), whose sum is σ = 1021100544. Its totient is φ = 987209280.
The previous prime is 1004111113. The next prime is 1004111159. The reversal of 1004111131 is 1311114001.
It is a happy number.
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 1004111131 - 25 = 1004111099 is a prime.
It is a super-2 number, since 2×10041111312 = 2016478326796198322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1004111191) 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, 1446 + ... + 44836.
It is an arithmetic number, because the mean of its divisors is an integer number (127637568).
Almost surely, 21004111131 is an apocalyptic number.
1004111131 is a deficient number, since it is larger than the sum of its proper divisors (16989413).
1004111131 is an equidigital number, since it uses as much as digits as its factorization.
1004111131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43781.
The product of its (nonzero) digits is 12, while the sum is 13.
The square root of 1004111131 is about 31687.7126186161. The cubic root of 1004111131 is about 1001.3685033443.
Adding to 1004111131 its reverse (1311114001), we get a palindrome (2315225132).
The spelling of 1004111131 in words is "one billion, four million, one hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •