Base | Representation |
---|---|
bin | 11101010000111001100… |
… | …010110011110110100001 |
3 | 21010020202202022221202211 |
4 | 131100321202303312201 |
5 | 230422022042333441 |
6 | 4135502330042121 |
7 | 265201463663401 |
oct | 35207142636641 |
9 | 7106682287684 |
10 | 2011010121121 |
11 | 705956871841 |
12 | 2858b7279341 |
13 | 1178395c3741 |
14 | 6d494c36801 |
15 | 3749e8baa81 |
hex | 1d4398b3da1 |
2011010121121 has 8 divisors (see below), whose sum is σ = 2014220129544. Its totient is φ = 2007800340480.
The previous prime is 2011010121089. The next prime is 2011010121209. The reversal of 2011010121121 is 1211210101102.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 894688974400 + 1116321146721 = 945880^2 + 1056561^2 .
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 2011010121121 - 25 = 2011010121089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2011010128121) 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, 30936165 + ... + 31001101.
It is an arithmetic number, because the mean of its divisors is an integer number (251777516193).
Almost surely, 22011010121121 is an apocalyptic number.
It is an amenable number.
2011010121121 is a deficient number, since it is larger than the sum of its proper divisors (3210008423).
2011010121121 is an equidigital number, since it uses as much as digits as its factorization.
2011010121121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113891.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 2011010121121 its reverse (1211210101102), we get a palindrome (3222220222223).
The spelling of 2011010121121 in words is "two trillion, eleven billion, ten million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •