Base | Representation |
---|---|
bin | 111011100110101… |
… | …1011111111001101 |
3 | 12011101101002121101 |
4 | 1313031123333031 |
5 | 13044000324323 |
6 | 530243103101 |
7 | 100363546324 |
oct | 16715337715 |
9 | 5141332541 |
10 | 2000011213 |
11 | 936a55032 |
12 | 479971a91 |
13 | 25b47c4b5 |
14 | 14d89d0bb |
15 | ba8b5dad |
hex | 7735bfcd |
2000011213 has 8 divisors (see below), whose sum is σ = 2016424800. Its totient is φ = 1983656208.
The previous prime is 2000011199. The next prime is 2000011217. The reversal of 2000011213 is 3121100002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2000011213 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2000011213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000011217) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55270 + ... + 83992.
It is an arithmetic number, because the mean of its divisors is an integer number (252053100).
Almost surely, 22000011213 is an apocalyptic number.
It is an amenable number.
2000011213 is a deficient number, since it is larger than the sum of its proper divisors (16413587).
2000011213 is a wasteful number, since it uses less digits than its factorization.
2000011213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29291.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 2000011213 is about 44721.4849149712. The cubic root of 2000011213 is about 1259.9234044729.
Adding to 2000011213 its reverse (3121100002), we get a palindrome (5121111215).
It can be divided in two parts, 20000 and 11213, that added together give a palindrome (31213).
The spelling of 2000011213 in words is "two billion, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •