Base | Representation |
---|---|
bin | 1100011001110111000… |
… | …0000010011001010101 |
3 | 202101001022021022012022 |
4 | 3012131300002121111 |
5 | 11442412100410031 |
6 | 241521412502525 |
7 | 21252550140101 |
oct | 3063560023125 |
9 | 671038238168 |
10 | 213100013141 |
11 | 82414446a44 |
12 | 3537291aa45 |
13 | 1713133a642 |
14 | a457c42901 |
15 | 582357e97b |
hex | 319dc02655 |
213100013141 has 4 divisors (see below), whose sum is σ = 213105184800. Its totient is φ = 213094841484.
The previous prime is 213100013117. The next prime is 213100013167. The reversal of 213100013141 is 141310001312.
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 a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-213100013141 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 (213100013741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2523521 + ... + 2606598.
It is an arithmetic number, because the mean of its divisors is an integer number (53276296200).
Almost surely, 2213100013141 is an apocalyptic number.
It is an amenable number.
213100013141 is a deficient number, since it is larger than the sum of its proper divisors (5171659).
213100013141 is an equidigital number, since it uses as much as digits as its factorization.
213100013141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5171658.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 213100013141 its reverse (141310001312), we get a palindrome (354410014453).
The spelling of 213100013141 in words is "two hundred thirteen billion, one hundred million, thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •