Base | Representation |
---|---|
bin | 1001001001100110010011… |
… | …10001011101010111011101 |
3 | 2122020112211220220001110212 |
4 | 10210303021301131113131 |
5 | 10114130313033001341 |
6 | 110443244301142205 |
7 | 4144460302035146 |
oct | 444631161352735 |
9 | 78215756801425 |
10 | 20121012000221 |
11 | 64583007a1980 |
12 | 230b70625a965 |
13 | b2c53204a3b2 |
14 | 4d7c0db56acd |
15 | 24d5d8add5eb |
hex | 124cc9c5d5dd |
20121012000221 has 8 divisors (see below), whose sum is σ = 22151572845600. Its totient is φ = 18124014144240.
The previous prime is 20121012000197. The next prime is 20121012000227. The reversal of 20121012000221 is 12200021012102.
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 20121012000221 - 26 = 20121012000157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20121012000196 and 20121012000205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20121012000227) 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, 8390746091 + ... + 8390748488.
It is an arithmetic number, because the mean of its divisors is an integer number (2768946605700).
Almost surely, 220121012000221 is an apocalyptic number.
It is an amenable number.
20121012000221 is a deficient number, since it is larger than the sum of its proper divisors (2030560845379).
20121012000221 is a wasteful number, since it uses less digits than its factorization.
20121012000221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16781494699.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20121012000221 its reverse (12200021012102), we get a palindrome (32321033012323).
The spelling of 20121012000221 in words is "twenty trillion, one hundred twenty-one billion, twelve million, two hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •