Base | Representation |
---|---|
bin | 11101010010110000110… |
… | …111011010100000000011 |
3 | 21010102221021020111102211 |
4 | 131102300313122200003 |
5 | 230440122033323021 |
6 | 4140433121322551 |
7 | 265302212526151 |
oct | 35226067324003 |
9 | 7112837214384 |
10 | 2013012011011 |
11 | 70679388a2a1 |
12 | 286175796457 |
13 | 117a98280081 |
14 | 6d604a643d1 |
15 | 3756a5033e1 |
hex | 1d4b0dda803 |
2013012011011 has 8 divisors (see below), whose sum is σ = 2015577138960. Its totient is φ = 2010447773568.
The previous prime is 2013012010993. The next prime is 2013012011069. The reversal of 2013012011011 is 1101102103102.
It is a happy number.
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 2013012011011 - 219 = 2013011486723 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2013012010982 and 2013012011000.
It is not an unprimeable number, because it can be changed into a prime (2013012011111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4361280 + ... + 4800706.
It is an arithmetic number, because the mean of its divisors is an integer number (251947142370).
Almost surely, 22013012011011 is an apocalyptic number.
2013012011011 is a deficient number, since it is larger than the sum of its proper divisors (2565127949).
2013012011011 is an equidigital number, since it uses as much as digits as its factorization.
2013012011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 445253.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 2013012011011 its reverse (1101102103102), we get a palindrome (3114114114113).
The spelling of 2013012011011 in words is "two trillion, thirteen billion, twelve million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •