Base | Representation |
---|---|
bin | 1100011011011001010… |
… | …0001011110100110010 |
3 | 202102010000202121212221 |
4 | 3012312110023310302 |
5 | 11444233102022010 |
6 | 242030334111254 |
7 | 21266013156250 |
oct | 3066624136462 |
9 | 672100677787 |
10 | 213512142130 |
11 | 82606046611 |
12 | 3546894b52a |
13 | 17198837851 |
14 | a4968835d0 |
15 | 584983bdda |
hex | 31b650bd32 |
213512142130 has 64 divisors (see below), whose sum is σ = 446105698560. Its totient is φ = 72058973184.
The previous prime is 213512142113. The next prime is 213512142139. The reversal of 213512142130 is 31241215312.
213512142130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 213512142095 and 213512142104.
It is not an unprimeable number, because it can be changed into a prime (213512142139) by changing a digit.
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, 6704886 + ... + 6736654.
It is an arithmetic number, because the mean of its divisors is an integer number (6970401540).
Almost surely, 2213512142130 is an apocalyptic number.
213512142130 is an abundant number, since it is smaller than the sum of its proper divisors (232593556430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213512142130 is a wasteful number, since it uses less digits than its factorization.
213512142130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33283.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 213512142130 its reverse (31241215312), we get a palindrome (244753357442).
The spelling of 213512142130 in words is "two hundred thirteen billion, five hundred twelve million, one hundred forty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •