Base | Representation |
---|---|
bin | 1100011001100110100… |
… | …0110001110000100100 |
3 | 202100212111102010111200 |
4 | 3012121220301300210 |
5 | 11442241414013444 |
6 | 241510505402500 |
7 | 21251051426634 |
oct | 3063150616044 |
9 | 670774363450 |
10 | 213031001124 |
11 | 823894a0217 |
12 | 35353799430 |
13 | 1711cc56726 |
14 | a44c9da6c4 |
15 | 581c49b969 |
hex | 3199a31c24 |
213031001124 has 72 divisors (see below), whose sum is σ = 550318274688. Its totient is φ = 69453236160.
The previous prime is 213031001123. The next prime is 213031001153. The reversal of 213031001124 is 421100130312.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 213031001097 and 213031001106.
It is not an unprimeable number, because it can be changed into a prime (213031001123) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2549334 + ... + 2631570.
Almost surely, 2213031001124 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 213031001124, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (275159137344).
213031001124 is an abundant number, since it is smaller than the sum of its proper divisors (337287273564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213031001124 is a wasteful number, since it uses less digits than its factorization.
213031001124 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83825 (or 83820 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 213031001124 its reverse (421100130312), we get a palindrome (634131131436).
The spelling of 213031001124 in words is "two hundred thirteen billion, thirty-one million, one thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •