Base | Representation |
---|---|
bin | 101101011001101110100… |
… | …111111100001111011101 |
3 | 102001021021022121201121121 |
4 | 231121232213330033131 |
5 | 402104231032033041 |
6 | 10345150443330541 |
7 | 441261364206550 |
oct | 55315647741735 |
9 | 12037238551547 |
10 | 3120002221021 |
11 | aa3204a08554 |
12 | 424816520a51 |
13 | 1982a431418a |
14 | ab01a65a697 |
15 | 562599d77d1 |
hex | 2d66e9fc3dd |
3120002221021 has 8 divisors (see below), whose sum is σ = 3775464872640. Its totient is φ = 2516976581568.
The previous prime is 3120002220989. The next prime is 3120002221051. The reversal of 3120002221021 is 1201222000213.
It is a happy number.
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 3120002221021 - 25 = 3120002220989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3120002220986 and 3120002221004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3120002221051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13109252911 + ... + 13109253148.
It is an arithmetic number, because the mean of its divisors is an integer number (471933109080).
Almost surely, 23120002221021 is an apocalyptic number.
It is an amenable number.
3120002221021 is a deficient number, since it is larger than the sum of its proper divisors (655462651619).
3120002221021 is a wasteful number, since it uses less digits than its factorization.
3120002221021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26218506083.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 3120002221021 its reverse (1201222000213), we get a palindrome (4321224221234).
The spelling of 3120002221021 in words is "three trillion, one hundred twenty billion, two million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •