Base | Representation |
---|---|
bin | 1001100110011110000001… |
… | …11000001000100000010101 |
3 | 2202202101100021200212111021 |
4 | 10303033000320020200111 |
5 | 10231403411022401323 |
6 | 112523102311041141 |
7 | 4306235553436525 |
oct | 463170070104025 |
9 | 82671307625437 |
10 | 21113000200213 |
11 | 67aaa7821a949 |
12 | 244ba110701b1 |
13 | ba1c41500b6c |
14 | 52dc36103685 |
15 | 2692e6cc805d |
hex | 1333c0e08815 |
21113000200213 has 8 divisors (see below), whose sum is σ = 21410471511936. Its totient is φ = 20815531808400.
The previous prime is 21113000200183. The next prime is 21113000200217. The reversal of 21113000200213 is 31200200031112.
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-21113000200213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21113000200217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16766895 + ... + 17982067.
It is an arithmetic number, because the mean of its divisors is an integer number (2676308938992).
Almost surely, 221113000200213 is an apocalyptic number.
It is an amenable number.
21113000200213 is a deficient number, since it is larger than the sum of its proper divisors (297471311723).
21113000200213 is a wasteful number, since it uses less digits than its factorization.
21113000200213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1459955.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 21113000200213 its reverse (31200200031112), we get a palindrome (52313200231325).
The spelling of 21113000200213 in words is "twenty-one trillion, one hundred thirteen billion, two hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •