Base | Representation |
---|---|
bin | 1100011010010101111… |
… | …1111100011011100101 |
3 | 202101101100212221021210 |
4 | 3012211133330123211 |
5 | 11443143340342013 |
6 | 241542335102033 |
7 | 21256016124645 |
oct | 3064537743345 |
9 | 671340787253 |
10 | 213230012133 |
11 | 82480868126 |
12 | 353aa371919 |
13 | 17152255818 |
14 | a46b202525 |
15 | 582ebaccc3 |
hex | 31a57fc6e5 |
213230012133 has 4 divisors (see below), whose sum is σ = 284306682848. Its totient is φ = 142153341420.
The previous prime is 213230012101. The next prime is 213230012173. The reversal of 213230012133 is 331210032312.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 213230012133 - 25 = 213230012101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213230012173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35538335353 + ... + 35538335358.
It is an arithmetic number, because the mean of its divisors is an integer number (71076670712).
Almost surely, 2213230012133 is an apocalyptic number.
It is an amenable number.
213230012133 is a deficient number, since it is larger than the sum of its proper divisors (71076670715).
213230012133 is an equidigital number, since it uses as much as digits as its factorization.
213230012133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71076670714.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 213230012133 its reverse (331210032312), we get a palindrome (544440044445).
The spelling of 213230012133 in words is "two hundred thirteen billion, two hundred thirty million, twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •