Base | Representation |
---|---|
bin | 11101001111111110101… |
… | …011101110001001110011 |
3 | 21010011012221010202021210 |
4 | 131033332223232021303 |
5 | 230413011241220311 |
6 | 4135220332051203 |
7 | 265135143132063 |
oct | 35177653561163 |
9 | 7104187122253 |
10 | 2010022601331 |
11 | 70549a3a2588 |
12 | 285680603b03 |
13 | 11770cb35cc4 |
14 | 6d3dda173a3 |
15 | 37442d523a6 |
hex | 1d3feaee273 |
2010022601331 has 8 divisors (see below), whose sum is σ = 2694061707264. Its totient is φ = 1332999281480.
The previous prime is 2010022601329. The next prime is 2010022601347. The reversal of 2010022601331 is 1331062200102.
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 2010022601331 - 21 = 2010022601329 is a prime.
It is a super-2 number, since 2×20100226013312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2010022601298 and 2010022601307.
It is not an unprimeable number, because it can be changed into a prime (2010022601381) 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, 1753945851 + ... + 1753946996.
It is an arithmetic number, because the mean of its divisors is an integer number (336757713408).
Almost surely, 22010022601331 is an apocalyptic number.
2010022601331 is a deficient number, since it is larger than the sum of its proper divisors (684039105933).
2010022601331 is a wasteful number, since it uses less digits than its factorization.
2010022601331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3507893041.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 2010022601331 its reverse (1331062200102), we get a palindrome (3341084801433).
The spelling of 2010022601331 in words is "two trillion, ten billion, twenty-two million, six hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •