Base | Representation |
---|---|
bin | 111011111011101… |
… | …0111000010110101 |
3 | 12012011001102210000 |
4 | 1313313113002311 |
5 | 13104304013023 |
6 | 531314421513 |
7 | 100556140500 |
oct | 16767270265 |
9 | 5164042700 |
10 | 2011001013 |
11 | 94218090a |
12 | 481591899 |
13 | 260829738 |
14 | 151120137 |
15 | bb837243 |
hex | 77dd70b5 |
2011001013 has 60 divisors (see below), whose sum is σ = 3534436620. Its totient is φ = 1136032128.
The previous prime is 2011000963. The next prime is 2011001033. The reversal of 2011001013 is 3101001102.
It can be written as a sum of positive squares in 2 ways, for example, as 313396209 + 1697604804 = 17703^2 + 41202^2 .
It is not a de Polignac number, because 2011001013 - 216 = 2010935477 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 2011000986 and 2011001004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011001033) by changing a digit.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 350395 + ... + 356087.
It is an arithmetic number, because the mean of its divisors is an integer number (58907277).
Almost surely, 22011001013 is an apocalyptic number.
It is an amenable number.
2011001013 is a deficient number, since it is larger than the sum of its proper divisors (1523435607).
2011001013 is an equidigital number, since it uses as much as digits as its factorization.
2011001013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5808 (or 5792 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 2011001013 is about 44844.1859442225. The cubic root of 2011001013 is about 1262.2268952508.
Adding to 2011001013 its reverse (3101001102), we get a palindrome (5112002115).
The spelling of 2011001013 in words is "two billion, eleven million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •