Base | Representation |
---|---|
bin | 1100011001100011111… |
… | …1100111111110001101 |
3 | 202100211202010001011110 |
4 | 3012120333213332031 |
5 | 11442231133310013 |
6 | 241505442242233 |
7 | 21250560636030 |
oct | 3063077477615 |
9 | 670752101143 |
10 | 213020213133 |
11 | 823833a2022 |
12 | 35350056379 |
13 | 1711a94a2c0 |
14 | a44b3cd017 |
15 | 581b56a2c3 |
hex | 3198fe7f8d |
213020213133 has 64 divisors (see below), whose sum is σ = 355723038720. Its totient is φ = 110387515392.
The previous prime is 213020213123. The next prime is 213020213143. The reversal of 213020213133 is 331312020312.
It is an interprime number because it is at equal distance from previous prime (213020213123) and next prime (213020213143).
It is not a de Polignac number, because 213020213133 - 29 = 213020212621 is a prime.
It is a super-2 number, since 2×2130202131332 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213020213123) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 33612141 + ... + 33618477.
It is an arithmetic number, because the mean of its divisors is an integer number (5558172480).
Almost surely, 2213020213133 is an apocalyptic number.
It is an amenable number.
213020213133 is a deficient number, since it is larger than the sum of its proper divisors (142702825587).
213020213133 is a wasteful number, since it uses less digits than its factorization.
213020213133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8506.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 213020213133 its reverse (331312020312), we get a palindrome (544332233445).
The spelling of 213020213133 in words is "two hundred thirteen billion, twenty million, two hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •