Base | Representation |
---|---|
bin | 11101000110101001101… |
… | …01111011110010111101 |
3 | 10112121011221200011001211 |
4 | 32203110311323302331 |
5 | 112341001322233041 |
6 | 2043221205404421 |
7 | 132151004660215 |
oct | 16432465736275 |
9 | 3477157604054 |
10 | 1000003321021 |
11 | 35610a894041 |
12 | 141983109711 |
13 | 733b8b8c343 |
14 | 36586a6d245 |
15 | 1b02bbc0481 |
hex | e8d4d7bcbd |
1000003321021 has 4 divisors (see below), whose sum is σ = 1009712091232. Its totient is φ = 990294550812.
The previous prime is 1000003321001. The next prime is 1000003321043. The reversal of 1000003321021 is 1201233000001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1000003321021 - 213 = 1000003312829 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1000003320992 and 1000003321010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000003321001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4854384951 + ... + 4854385156.
It is an arithmetic number, because the mean of its divisors is an integer number (252428022808).
Almost surely, 21000003321021 is an apocalyptic number.
It is an amenable number.
1000003321021 is a deficient number, since it is larger than the sum of its proper divisors (9708770211).
1000003321021 is an equidigital number, since it uses as much as digits as its factorization.
1000003321021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9708770210.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 1000003321021 its reverse (1201233000001), we get a palindrome (2201236321022).
The spelling of 1000003321021 in words is "one trillion, three million, three hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •