Base | Representation |
---|---|
bin | 11101001111111101111… |
… | …111100000001111011011 |
3 | 21010011012010022211222122 |
4 | 131033331333200033123 |
5 | 230413000304310021 |
6 | 4135215235411455 |
7 | 265134642454124 |
oct | 35177577401733 |
9 | 7104163284878 |
10 | 2010011010011 |
11 | 7054938a5884 |
12 | 285678753b8b |
13 | 11770a608034 |
14 | 6d3dc27b04b |
15 | 37441d12bab |
hex | 1d3fdfe03db |
2010011010011 has 4 divisors (see below), whose sum is σ = 2010053181312. Its totient is φ = 2009968838712.
The previous prime is 2010011009917. The next prime is 2010011010037. The reversal of 2010011010011 is 1100101100102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2010011010011 is a prime.
It is a super-3 number, since 3×20100110100113 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2010011010061) 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, 21014075 + ... + 21109508.
It is an arithmetic number, because the mean of its divisors is an integer number (502513295328).
Almost surely, 22010011010011 is an apocalyptic number.
2010011010011 is a deficient number, since it is larger than the sum of its proper divisors (42171301).
2010011010011 is an equidigital number, since it uses as much as digits as its factorization.
2010011010011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42171300.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 2010011010011 its reverse (1100101100102), we get a palindrome (3110112110113).
Subtracting from 2010011010011 its reverse (1100101100102), we obtain a palindrome (909909909909).
The spelling of 2010011010011 in words is "two trillion, ten billion, eleven million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •