Base | Representation |
---|---|
bin | 11101010000111001100… |
… | …010110001101000000001 |
3 | 21010020202202022111021001 |
4 | 131100321202301220001 |
5 | 230422022042041001 |
6 | 4135502325532001 |
7 | 265201463624662 |
oct | 35207142615001 |
9 | 7106682274231 |
10 | 2011010112001 |
11 | 705956865a00 |
12 | 2858b7274001 |
13 | 1178395bc547 |
14 | 6d494c33369 |
15 | 3749e8b8001 |
hex | 1d4398b1a01 |
2011010112001 has 12 divisors (see below), whose sum is σ = 2210488262500. Its totient is φ = 1828158647040.
The previous prime is 2011010111993. The next prime is 2011010112011. The reversal of 2011010112001 is 1002110101102.
It can be written as a sum of positive squares in 2 ways, for example, as 1594663840000 + 416346272001 = 1262800^2 + 645249^2 .
It is not a de Polignac number, because 2011010112001 - 23 = 2011010111993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2011010112011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9117145 + ... + 9335113.
Almost surely, 22011010112001 is an apocalyptic number.
It is an amenable number.
2011010112001 is a deficient number, since it is larger than the sum of its proper divisors (199478150499).
2011010112001 is a wasteful number, since it uses less digits than its factorization.
2011010112001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294240 (or 294229 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 2011010112001 its reverse (1002110101102), we get a palindrome (3013120213103).
It can be divided in two parts, 20110101 and 12001, that added together give a palindrome (20122102).
The spelling of 2011010112001 in words is "two trillion, eleven billion, ten million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •