Base | Representation |
---|---|
bin | 11101101100100000111… |
… | …11000110001011010101 |
3 | 10121112122122101111100200 |
4 | 32312100133012023111 |
5 | 113204114304220041 |
6 | 2100422253131113 |
7 | 133500522056346 |
oct | 16662037061325 |
9 | 3545578344320 |
10 | 1020331320021 |
11 | 3637a1480612 |
12 | 1458b6a89a99 |
13 | 752a84b9010 |
14 | 375547360cd |
15 | 1b81b62b1b6 |
hex | ed907c62d5 |
1020331320021 has 48 divisors (see below), whose sum is σ = 1681052405760. Its totient is φ = 590782947840.
The previous prime is 1020331319993. The next prime is 1020331320059. The reversal of 1020331320021 is 1200231330201.
1020331320021 is a `hidden beast` number, since 10 + 2 + 0 + 331 + 320 + 0 + 2 + 1 = 666.
It is not a de Polignac number, because 1020331320021 - 210 = 1020331318997 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1020331319976 and 1020331320003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020331320121) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6669060 + ... + 6820338.
It is an arithmetic number, because the mean of its divisors is an integer number (35021925120).
Almost surely, 21020331320021 is an apocalyptic number.
It is an amenable number.
1020331320021 is a deficient number, since it is larger than the sum of its proper divisors (660721085739).
1020331320021 is a wasteful number, since it uses less digits than its factorization.
1020331320021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154706 (or 154703 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 1020331320021 its reverse (1200231330201), we get a palindrome (2220562650222).
The spelling of 1020331320021 in words is "one trillion, twenty billion, three hundred thirty-one million, three hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •