Base | Representation |
---|---|
bin | 11101010000001010011… |
… | …101010001111011110001 |
3 | 21010011201200211212120202 |
4 | 131100022131101323301 |
5 | 230413412324023241 |
6 | 4135252110044545 |
7 | 265143062165246 |
oct | 35201235217361 |
9 | 7104650755522 |
10 | 2010220142321 |
11 | 705590955aa6 |
12 | 2857167a9755 |
13 | 117741a3bc71 |
14 | 6d41bd595cd |
15 | 37455372d9b |
hex | 1d40a751ef1 |
2010220142321 has 24 divisors (see below), whose sum is σ = 2084812578912. Its totient is φ = 1937803795200.
The previous prime is 2010220142311. The next prime is 2010220142351. The reversal of 2010220142321 is 1232410220102.
It is not a de Polignac number, because 2010220142321 - 214 = 2010220125937 is a prime.
It is a super-2 number, since 2×20102201423212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2010220142293 and 2010220142302.
It is not an unprimeable number, because it can be changed into a prime (2010220142311) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 40560326 + ... + 40609856.
It is an arithmetic number, because the mean of its divisors is an integer number (86867190788).
Almost surely, 22010220142321 is an apocalyptic number.
It is an amenable number.
2010220142321 is a deficient number, since it is larger than the sum of its proper divisors (74592436591).
2010220142321 is an frugal number, since it uses more digits than its factorization.
2010220142321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49853 (or 49782 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 2010220142321 its reverse (1232410220102), we get a palindrome (3242630362423).
The spelling of 2010220142321 in words is "two trillion, ten billion, two hundred twenty million, one hundred forty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •