Base | Representation |
---|---|
bin | 11101010000000101000… |
… | …101011111111010000101 |
3 | 21010011111102021021202212 |
4 | 131100011011133322011 |
5 | 230413221241201041 |
6 | 4135235130313205 |
7 | 265140616161662 |
oct | 35200505377205 |
9 | 7104442237685 |
10 | 2010130022021 |
11 | 705544aa2310 |
12 | 2856b0588805 |
13 | 117729177344 |
14 | 6d40ddbaa69 |
15 | 3744c4c08eb |
hex | 1d40515fe85 |
2010130022021 has 16 divisors (see below), whose sum is σ = 2283856103808. Its totient is φ = 1752959678400.
The previous prime is 2010130022011. The next prime is 2010130022029. The reversal of 2010130022021 is 1202200310102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 2010130022021 - 218 = 2010129759877 is a prime.
It is a super-3 number, since 3×20101300220213 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2010130021987 and 2010130022005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010130022029) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34752050 + ... + 34809843.
It is an arithmetic number, because the mean of its divisors is an integer number (142741006488).
Almost surely, 22010130022021 is an apocalyptic number.
It is an amenable number.
2010130022021 is a deficient number, since it is larger than the sum of its proper divisors (273726081787).
2010130022021 is a wasteful number, since it uses less digits than its factorization.
2010130022021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69562012.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 2010130022021 its reverse (1202200310102), we get a palindrome (3212330332123).
The spelling of 2010130022021 in words is "two trillion, ten billion, one hundred thirty million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •