Base | Representation |
---|---|
bin | 1100011001111110101… |
… | …0110111110000110101 |
3 | 202101010112212020111211 |
4 | 3012133222313300311 |
5 | 11442443321311201 |
6 | 241524523001421 |
7 | 21253420631110 |
oct | 3063752676065 |
9 | 671115766454 |
10 | 213132213301 |
11 | 8243063a447 |
12 | 35381669271 |
13 | 17137c02ba7 |
14 | a45c225577 |
15 | 58262e0651 |
hex | 319fab7c35 |
213132213301 has 8 divisors (see below), whose sum is σ = 243583578560. Its totient is φ = 182681824608.
The previous prime is 213132213299. The next prime is 213132213331. The reversal of 213132213301 is 103312231312.
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 213132213301 - 21 = 213132213299 is a prime.
It is a super-2 number, since 2×2131322133012 (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 (213132213331) 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, 306265 + ... + 721153.
It is an arithmetic number, because the mean of its divisors is an integer number (30447947320).
Almost surely, 2213132213301 is an apocalyptic number.
It is an amenable number.
213132213301 is a deficient number, since it is larger than the sum of its proper divisors (30451365259).
213132213301 is an equidigital number, since it uses as much as digits as its factorization.
213132213301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488283.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 213132213301 its reverse (103312231312), we get a palindrome (316444444613).
The spelling of 213132213301 in words is "two hundred thirteen billion, one hundred thirty-two million, two hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •