Base | Representation |
---|---|
bin | 1100011010101001000… |
… | …1110101110111111101 |
3 | 202101120221202222012110 |
4 | 3012222101311313331 |
5 | 11443324402420331 |
6 | 241554321524233 |
7 | 21261011536506 |
oct | 3065221656775 |
9 | 671527688173 |
10 | 213310201341 |
11 | 825120584a6 |
12 | 354111a3679 |
13 | 17165a51063 |
14 | a477b17bad |
15 | 5836c4c946 |
hex | 31aa475dfd |
213310201341 has 8 divisors (see below), whose sum is σ = 284979038400. Its totient is φ = 141924082592.
The previous prime is 213310201339. The next prime is 213310201411. The reversal of 213310201341 is 143102013312.
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 213310201341 - 21 = 213310201339 is a prime.
It is a super-2 number, since 2×2133102013412 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213310201331) 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 7 ways as a sum of consecutive naturals, for example, 70677816 + ... + 70680833.
It is an arithmetic number, because the mean of its divisors is an integer number (35622379800).
Almost surely, 2213310201341 is an apocalyptic number.
It is an amenable number.
213310201341 is a deficient number, since it is larger than the sum of its proper divisors (71668837059).
213310201341 is a wasteful number, since it uses less digits than its factorization.
213310201341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141359155.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 213310201341 its reverse (143102013312), we get a palindrome (356412214653).
The spelling of 213310201341 in words is "two hundred thirteen billion, three hundred ten million, two hundred one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •