Base | Representation |
---|---|
bin | 1100011010101011011… |
… | …1101110010110101011 |
3 | 202101121122110111112001 |
4 | 3012222313232112223 |
5 | 11443334423211021 |
6 | 241555314431431 |
7 | 21261162130060 |
oct | 3065267562653 |
9 | 671548414461 |
10 | 213320132011 |
11 | 82517720568 |
12 | 35414592577 |
13 | 17167b1a1ac |
14 | a479180c67 |
15 | 5837a60091 |
hex | 31aadee5ab |
213320132011 has 32 divisors (see below), whose sum is σ = 270540472320. Its totient is φ = 164067703200.
The previous prime is 213320131993. The next prime is 213320132017. The reversal of 213320132011 is 110231023312.
It is a cyclic number.
It is not a de Polignac number, because 213320132011 - 27 = 213320131883 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 213320132011.
It is not an unprimeable number, because it can be changed into a prime (213320132017) 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 31 ways as a sum of consecutive naturals, for example, 356635 + ... + 744196.
It is an arithmetic number, because the mean of its divisors is an integer number (8454389760).
Almost surely, 2213320132011 is an apocalyptic number.
213320132011 is a deficient number, since it is larger than the sum of its proper divisors (57220340309).
213320132011 is a wasteful number, since it uses less digits than its factorization.
213320132011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100935.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 213320132011 its reverse (110231023312), we get a palindrome (323551155323).
The spelling of 213320132011 in words is "two hundred thirteen billion, three hundred twenty million, one hundred thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •