Base | Representation |
---|---|
bin | 111011110011101… |
… | …101101000110101 |
3 | 2120221002121112012 |
4 | 323303231220311 |
5 | 4023333141041 |
6 | 243322334005 |
7 | 33602601323 |
oct | 7363555065 |
9 | 2527077465 |
10 | 1003412021 |
11 | 475444337 |
12 | 24005a305 |
13 | 12cb63231 |
14 | 97398d13 |
15 | 5d1573eb |
hex | 3bceda35 |
1003412021 has 8 divisors (see below), whose sum is σ = 1056982080. Its totient is φ = 949917888.
The previous prime is 1003411993. The next prime is 1003412027. The reversal of 1003412021 is 1202143001.
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 1003412021 - 222 = 999217717 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1003411987 and 1003412005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1003412027) 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, 9245 + ... + 45741.
It is an arithmetic number, because the mean of its divisors is an integer number (132122760).
Almost surely, 21003412021 is an apocalyptic number.
It is an amenable number.
1003412021 is a deficient number, since it is larger than the sum of its proper divisors (53570059).
1003412021 is a wasteful number, since it uses less digits than its factorization.
1003412021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37963.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 1003412021 is about 31676.6794503464. The cubic root of 1003412021 is about 1001.1360492367.
Adding to 1003412021 its reverse (1202143001), we get a palindrome (2205555022).
The spelling of 1003412021 in words is "one billion, three million, four hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •