Base | Representation |
---|---|
bin | 1100011010010001110… |
… | …0011111100000101111 |
3 | 202101100010121121000010 |
4 | 3012210130133200233 |
5 | 11443124324030111 |
6 | 241540504104303 |
7 | 21255412621431 |
oct | 3064434374057 |
9 | 671303547003 |
10 | 213212330031 |
11 | 82471890318 |
12 | 353a4465093 |
13 | 1714b6a443c |
14 | a468b1c651 |
15 | 582d368aa6 |
hex | 31a471f82f |
213212330031 has 8 divisors (see below), whose sum is σ = 285309400624. Its totient is φ = 141628406400.
The previous prime is 213212330021. The next prime is 213212330041. The reversal of 213212330031 is 130033212312.
It is an interprime number because it is at equal distance from previous prime (213212330021) and next prime (213212330041).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 213212330031 - 210 = 213212329007 is a prime.
It is a super-2 number, since 2×2132123300312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213212330021) 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, 128285770 + ... + 128287431.
It is an arithmetic number, because the mean of its divisors is an integer number (35663675078).
Almost surely, 2213212330031 is an apocalyptic number.
213212330031 is a deficient number, since it is larger than the sum of its proper divisors (72097070593).
213212330031 is a wasteful number, since it uses less digits than its factorization.
213212330031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 256573481.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 213212330031 its reverse (130033212312), we get a palindrome (343245542343).
The spelling of 213212330031 in words is "two hundred thirteen billion, two hundred twelve million, three hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •