Base | Representation |
---|---|
bin | 11101001010100110001… |
… | …00010100101001000101 |
3 | 10112210122112111111201012 |
4 | 32211103010110221011 |
5 | 112404320440201041 |
6 | 2044211255212005 |
7 | 132254331066500 |
oct | 16452304245105 |
9 | 3483575444635 |
10 | 1002121022021 |
11 | 356aa7212159 |
12 | 142274377005 |
13 | 73665837062 |
14 | 36708006137 |
15 | 1b102a823eb |
hex | e953114a45 |
1002121022021 has 36 divisors (see below), whose sum is σ = 1267138147968. Its totient is φ = 789632500608.
The previous prime is 1002121022003. The next prime is 1002121022047. The reversal of 1002121022021 is 1202201212001.
It is not a de Polignac number, because 1002121022021 - 222 = 1002116827717 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1002121021987 and 1002121022005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002121022051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 213941 + ... + 1431786.
It is an arithmetic number, because the mean of its divisors is an integer number (35198281888).
Almost surely, 21002121022021 is an apocalyptic number.
It is an amenable number.
1002121022021 is a deficient number, since it is larger than the sum of its proper divisors (265017125947).
1002121022021 is a wasteful number, since it uses less digits than its factorization.
1002121022021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1645818 (or 1645794 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1002121022021 its reverse (1202201212001), we get a palindrome (2204322234022).
The spelling of 1002121022021 in words is "one trillion, two billion, one hundred twenty-one million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •