Base | Representation |
---|---|
bin | 110000011110110001101001… |
… | …111001001001111010101100 |
3 | 1000221221202000100221120212010 |
4 | 300132301221321021322230 |
5 | 210421403340024030012 |
6 | 2033252234122241220 |
7 | 62624501306003550 |
oct | 6036615171117254 |
9 | 1027852010846763 |
10 | 213221133033132 |
11 | 61a36635a2a884 |
12 | 1bab7826056210 |
13 | 91c88885b94a3 |
14 | 3a91d5a6ad860 |
15 | 199b587124c3c |
hex | c1ec69e49eac |
213221133033132 has 96 divisors (see below), whose sum is σ = 579505727324160. Its totient is φ = 59761527598080.
The previous prime is 213221133033131. The next prime is 213221133033149. The reversal of 213221133033132 is 231330331122312.
It is a self number, because there is not a number n which added to its sum of digits gives 213221133033132.
It is not an unprimeable number, because it can be changed into a prime (213221133033131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 111336969 + ... + 113235872.
It is an arithmetic number, because the mean of its divisors is an integer number (6036517992960).
Almost surely, 2213221133033132 is an apocalyptic number.
It is an amenable number.
213221133033132 is an abundant number, since it is smaller than the sum of its proper divisors (366284594291028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213221133033132 is a wasteful number, since it uses less digits than its factorization.
213221133033132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224573071 (or 224573069 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 30.
Adding to 213221133033132 its reverse (231330331122312), we get a palindrome (444551464155444).
The spelling of 213221133033132 in words is "two hundred thirteen trillion, two hundred twenty-one billion, one hundred thirty-three million, thirty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •