Base | Representation |
---|---|
bin | 11101010001111011000… |
… | …110100110001000000001 |
3 | 21010100121101222122220212 |
4 | 131101323012212020001 |
5 | 230431300131133441 |
6 | 4140203420443505 |
7 | 265240650662054 |
oct | 35217306461001 |
9 | 7110541878825 |
10 | 2012110021121 |
11 | 706370718a02 |
12 | 285b636a9595 |
13 | 11798343aa45 |
14 | 6d55ad4aa9b |
15 | 37516231eeb |
hex | 1d47b1a6201 |
2012110021121 has 4 divisors (see below), whose sum is σ = 2012568260544. Its totient is φ = 2011651781700.
The previous prime is 2012110021099. The next prime is 2012110021169. The reversal of 2012110021121 is 1211200112102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2012110021121 - 234 = 1994930151937 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2012110021096 and 2012110021105.
It is not an unprimeable number, because it can be changed into a prime (2012110321121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 229113125 + ... + 229121906.
It is an arithmetic number, because the mean of its divisors is an integer number (503142065136).
Almost surely, 22012110021121 is an apocalyptic number.
It is an amenable number.
2012110021121 is a deficient number, since it is larger than the sum of its proper divisors (458239423).
2012110021121 is an equidigital number, since it uses as much as digits as its factorization.
2012110021121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 458239422.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2012110021121 its reverse (1211200112102), we get a palindrome (3223310133223).
The spelling of 2012110021121 in words is "two trillion, twelve billion, one hundred ten million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •