Base | Representation |
---|---|
bin | 111110000100101… |
… | …110000111101011 |
3 | 2200120121212100200 |
4 | 332010232013223 |
5 | 4113101044000 |
6 | 251201203243 |
7 | 34543652061 |
oct | 7604560753 |
9 | 2616555320 |
10 | 1041424875 |
11 | 494947a17 |
12 | 250930523 |
13 | 1379b244a |
14 | 9c452031 |
15 | 61665500 |
hex | 3e12e1eb |
1041424875 has 48 divisors (see below), whose sum is σ = 1883022336. Its totient is φ = 553747200.
The previous prime is 1041424873. The next prime is 1041424907. The reversal of 1041424875 is 5784241401.
It is a happy number.
It is not a de Polignac number, because 1041424875 - 21 = 1041424873 is a prime.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (1041424873) 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 47 ways as a sum of consecutive naturals, for example, 429667 + ... + 432083.
It is an arithmetic number, because the mean of its divisors is an integer number (39229632).
Almost surely, 21041424875 is an apocalyptic number.
1041424875 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1041424875 is a deficient number, since it is larger than the sum of its proper divisors (841597461).
1041424875 is a wasteful number, since it uses less digits than its factorization.
1041424875 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2821 (or 2808 counting only the distinct ones).
The product of its (nonzero) digits is 35840, while the sum is 36.
The square root of 1041424875 is about 32271.1151806069. The cubic root of 1041424875 is about 1013.6218931524.
The spelling of 1041424875 in words is "one billion, forty-one million, four hundred twenty-four thousand, eight hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •