Base | Representation |
---|---|
bin | 1100011001111110111… |
… | …0101000101100000100 |
3 | 202101010121201101012010 |
4 | 3012133232220230010 |
5 | 11442444044401012 |
6 | 241525000054220 |
7 | 21253432211136 |
oct | 3063756505404 |
9 | 671117641163 |
10 | 213133200132 |
11 | 82431153906 |
12 | 35381a64370 |
13 | 1713818a108 |
14 | a45c401056 |
15 | 5826437c3c |
hex | 319fba8b04 |
213133200132 has 12 divisors (see below), whose sum is σ = 497310800336. Its totient is φ = 71044400040.
The previous prime is 213133200103. The next prime is 213133200143. The reversal of 213133200132 is 231002331312.
213133200132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 213133200099 and 213133200108.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 8880549994 + ... + 8880550017.
Almost surely, 2213133200132 is an apocalyptic number.
It is an amenable number.
213133200132 is an abundant number, since it is smaller than the sum of its proper divisors (284177600204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213133200132 is a wasteful number, since it uses less digits than its factorization.
213133200132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17761100018 (or 17761100016 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 213133200132 its reverse (231002331312), we get a palindrome (444135531444).
The spelling of 213133200132 in words is "two hundred thirteen billion, one hundred thirty-three million, two hundred thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •