Base | Representation |
---|---|
bin | 1100011001111001111… |
… | …0100100001001010101 |
3 | 202101002011012222011000 |
4 | 3012132132210021111 |
5 | 11442423211210010 |
6 | 241522530133513 |
7 | 21253055616342 |
oct | 3063636441125 |
9 | 671064188130 |
10 | 213112210005 |
11 | 824203176a2 |
12 | 35376a21299 |
13 | 17133a1b116 |
14 | a4596d97c9 |
15 | 582468d7c0 |
hex | 319e7a4255 |
213112210005 has 32 divisors (see below), whose sum is σ = 380061388800. Its totient is φ = 113301274176.
The previous prime is 213112209991. The next prime is 213112210079. The reversal of 213112210005 is 500012211312.
213112210005 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 213112210005 - 233 = 204522275413 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 213112210005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2447125 + ... + 2532714.
It is an arithmetic number, because the mean of its divisors is an integer number (11876918400).
Almost surely, 2213112210005 is an apocalyptic number.
It is an amenable number.
213112210005 is a deficient number, since it is larger than the sum of its proper divisors (166949178795).
213112210005 is a wasteful number, since it uses less digits than its factorization.
213112210005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4980170 (or 4980164 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
Adding to 213112210005 its reverse (500012211312), we get a palindrome (713124421317).
The spelling of 213112210005 in words is "two hundred thirteen billion, one hundred twelve million, two hundred ten thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •