Base | Representation |
---|---|
bin | 11101010001000101011… |
… | …110001000001001011001 |
3 | 21010021021200212000222220 |
4 | 131101011132020021121 |
5 | 230422424304020441 |
6 | 4135534234534253 |
7 | 265206443542404 |
oct | 35210536101131 |
9 | 7107250760886 |
10 | 2011210220121 |
11 | 705a49812113 |
12 | 285952297389 |
13 | 11786bbb3b0b |
14 | 6d4b3642d3b |
15 | 374b2244466 |
hex | 1d445788259 |
2011210220121 has 8 divisors (see below), whose sum is σ = 2681649434304. Its totient is φ = 1340788909680.
The previous prime is 2011210220069. The next prime is 2011210220137. The reversal of 2011210220121 is 1210220121102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2011210220121 - 210 = 2011210219097 is a prime.
It is a super-2 number, since 2×20112102201212 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2011210220121.
It is not an unprimeable number, because it can be changed into a prime (2011210220171) 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, 4211590 + ... + 4664751.
It is an arithmetic number, because the mean of its divisors is an integer number (335206179288).
Almost surely, 22011210220121 is an apocalyptic number.
It is an amenable number.
2011210220121 is a deficient number, since it is larger than the sum of its proper divisors (670439214183).
2011210220121 is an equidigital number, since it uses as much as digits as its factorization.
2011210220121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8951871.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2011210220121 its reverse (1210220121102), we get a palindrome (3221430341223).
The spelling of 2011210220121 in words is "two trillion, eleven billion, two hundred ten million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •