Base | Representation |
---|---|
bin | 1100011011010110100… |
… | …0001101000110001001 |
3 | 202102002020001212220011 |
4 | 3012311220031012021 |
5 | 11444222124104001 |
6 | 242025243031521 |
7 | 21265513160524 |
oct | 3066550150611 |
9 | 672066055804 |
10 | 213500613001 |
11 | 825aa591605 |
12 | 35464b0b5a1 |
13 | 1719632bc90 |
14 | a495121bbb |
15 | 5848810d51 |
hex | 31b5a0d189 |
213500613001 has 8 divisors (see below), whose sum is σ = 229927685960. Its totient is φ = 197074104192.
The previous prime is 213500612953. The next prime is 213500613017. The reversal of 213500613001 is 100316005312.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 32600108025 + 180900504976 = 180555^2 + 425324^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 213500613001 - 27 = 213500612873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213500613041) 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 7 ways as a sum of consecutive naturals, for example, 968035 + ... + 1167943.
It is an arithmetic number, because the mean of its divisors is an integer number (28740960745).
Almost surely, 2213500613001 is an apocalyptic number.
It is an amenable number.
213500613001 is a deficient number, since it is larger than the sum of its proper divisors (16427072959).
213500613001 is a wasteful number, since it uses less digits than its factorization.
213500613001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282075.
The product of its (nonzero) digits is 540, while the sum is 22.
Adding to 213500613001 its reverse (100316005312), we get a palindrome (313816618313).
The spelling of 213500613001 in words is "two hundred thirteen billion, five hundred million, six hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •