Base | Representation |
---|---|
bin | 1100011001100010000… |
… | …1000110000101101111 |
3 | 202100211012001102222021 |
4 | 3012120201012011233 |
5 | 11442222111210111 |
6 | 241504554531011 |
7 | 21250432624255 |
oct | 3063041060557 |
9 | 670735042867 |
10 | 213012210031 |
11 | 82379926195 |
12 | 35349436a67 |
13 | 171190a763a |
14 | a44a3085d5 |
15 | 581a9d8d71 |
hex | 319884616f |
213012210031 has 16 divisors (see below), whose sum is σ = 229144960000. Its totient is φ = 197418495456.
The previous prime is 213012209989. The next prime is 213012210049. The reversal of 213012210031 is 130012210312.
It is a cyclic number.
It is not a de Polignac number, because 213012210031 - 29 = 213012209519 is a prime.
It is a super-2 number, since 2×2130122100312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 213012209987 and 213012210014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213012240031) 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 15 ways as a sum of consecutive naturals, for example, 487371 + ... + 814588.
It is an arithmetic number, because the mean of its divisors is an integer number (14321560000).
Almost surely, 2213012210031 is an apocalyptic number.
213012210031 is a deficient number, since it is larger than the sum of its proper divisors (16132749969).
213012210031 is a wasteful number, since it uses less digits than its factorization.
213012210031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1302166.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 213012210031 its reverse (130012210312), we get a palindrome (343024420343).
The spelling of 213012210031 in words is "two hundred thirteen billion, twelve million, two hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •