Base | Representation |
---|---|
bin | 111110000001001… |
… | …100110011110001 |
3 | 2200111212222102011 |
4 | 332001030303301 |
5 | 4112332031001 |
6 | 251125322521 |
7 | 34533056350 |
oct | 7601146361 |
9 | 2614788364 |
10 | 1040502001 |
11 | 494377610 |
12 | 250566441 |
13 | 13774b376 |
14 | 9c291997 |
15 | 61531d51 |
hex | 3e04ccf1 |
1040502001 has 8 divisors (see below), whose sum is σ = 1297249344. Its totient is φ = 810780720.
The previous prime is 1040501999. The next prime is 1040502019. The reversal of 1040502001 is 1002050401.
1040502001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 1040502001 - 21 = 1040501999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1040502041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6756430 + ... + 6756583.
It is an arithmetic number, because the mean of its divisors is an integer number (162156168).
Almost surely, 21040502001 is an apocalyptic number.
1040502001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1040502001 is a deficient number, since it is larger than the sum of its proper divisors (256747343).
1040502001 is a wasteful number, since it uses less digits than its factorization.
1040502001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13513031.
The product of its (nonzero) digits is 40, while the sum is 13.
The square root of 1040502001 is about 32256.8132492967. The cubic root of 1040502001 is about 1013.3223926734.
Adding to 1040502001 its reverse (1002050401), we get a palindrome (2042552402).
The spelling of 1040502001 in words is "one billion, forty million, five hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.240 sec. • engine limits •