Base | Representation |
---|---|
bin | 111011110111000… |
… | …110111100101001 |
3 | 2120222202211111212 |
4 | 323313012330221 |
5 | 4024100131441 |
6 | 243353402505 |
7 | 33613266344 |
oct | 7367067451 |
9 | 2528684455 |
10 | 1004302121 |
11 | 4759a2059 |
12 | 240409435 |
13 | 1300b5414 |
14 | 9754b45b |
15 | 5d280eeb |
hex | 3bdc6f29 |
1004302121 has 8 divisors (see below), whose sum is σ = 1008120000. Its totient is φ = 1000492560.
The previous prime is 1004302111. The next prime is 1004302147. The reversal of 1004302121 is 1212034001.
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 1004302121 - 210 = 1004301097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1004302096 and 1004302105.
It is not an unprimeable number, because it can be changed into a prime (1004302111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 333380 + ... + 336378.
It is an arithmetic number, because the mean of its divisors is an integer number (126015000).
Almost surely, 21004302121 is an apocalyptic number.
It is an amenable number.
1004302121 is a deficient number, since it is larger than the sum of its proper divisors (3817879).
1004302121 is an equidigital number, since it uses as much as digits as its factorization.
1004302121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4159.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 1004302121 is about 31690.7261040198. The cubic root of 1004302121 is about 1001.4319887627.
Adding to 1004302121 its reverse (1212034001), we get a palindrome (2216336122).
The spelling of 1004302121 in words is "one billion, four million, three hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •