Base | Representation |
---|---|
bin | 111110100111010… |
… | …1011101100110101 |
3 | 12102102101220120100 |
4 | 1331032223230311 |
5 | 13300324013023 |
6 | 544251424313 |
7 | 103031133246 |
oct | 17516535465 |
9 | 5372356510 |
10 | 2101001013 |
11 | 988a62181 |
12 | 4a7755099 |
13 | 27637b687 |
14 | 15d06accd |
15 | c46b3c43 |
hex | 7d3abb35 |
2101001013 has 12 divisors (see below), whose sum is σ = 3035755008. Its totient is φ = 1400217000.
The previous prime is 2101001009. The next prime is 2101001029. The reversal of 2101001013 is 3101001012.
It is not a de Polignac number, because 2101001013 - 22 = 2101001009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2101000986 and 2101001004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101001093) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6645 + ... + 65162.
It is an arithmetic number, because the mean of its divisors is an integer number (252979584).
Almost surely, 22101001013 is an apocalyptic number.
It is an amenable number.
2101001013 is a deficient number, since it is larger than the sum of its proper divisors (934753995).
2101001013 is a wasteful number, since it uses less digits than its factorization.
2101001013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75064 (or 75061 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 2101001013 is about 45836.6775955675. The cubic root of 2101001013 is about 1280.7826051092.
Adding to 2101001013 its reverse (3101001012), we get a palindrome (5202002025).
Subtracting 2101001013 from its reverse (3101001012), we obtain a palindrome (999999999).
The spelling of 2101001013 in words is "two billion, one hundred one million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •