Base | Representation |
---|---|
bin | 111011110011010… |
… | …111001011010101 |
3 | 2120220220221022210 |
4 | 323303113023111 |
5 | 4023322220041 |
6 | 243320344033 |
7 | 33602036154 |
oct | 7363271325 |
9 | 2526827283 |
10 | 1003320021 |
11 | 475391200 |
12 | 240015019 |
13 | 12cb303b2 |
14 | 9737359b |
15 | 5d13a016 |
hex | 3bcd72d5 |
1003320021 has 12 divisors (see below), whose sum is σ = 1470430976. Its totient is φ = 608072520.
The previous prime is 1003320011. The next prime is 1003320029. The reversal of 1003320021 is 1200233001.
It is a happy number.
It is not a de Polignac number, because 1003320021 - 227 = 869102293 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1003319979 and 1003320006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1003320029) 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 11 ways as a sum of consecutive naturals, for example, 1381621 + ... + 1382346.
Almost surely, 21003320021 is an apocalyptic number.
1003320021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1003320021 is a deficient number, since it is larger than the sum of its proper divisors (467110955).
1003320021 is a wasteful number, since it uses less digits than its factorization.
1003320021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2763992 (or 2763981 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
The square root of 1003320021 is about 31675.2272446466. The cubic root of 1003320021 is about 1001.1054511940.
Adding to 1003320021 its reverse (1200233001), we get a palindrome (2203553022).
The spelling of 1003320021 in words is "one billion, three million, three hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •