Base | Representation |
---|---|
bin | 11001011010101… |
… | …01100101001001 |
3 | 112212012021010221 |
4 | 30231111211021 |
5 | 414040231330 |
6 | 33053510041 |
7 | 5166160525 |
oct | 1455254511 |
9 | 485167127 |
10 | 213211465 |
11 | aa396a25 |
12 | 5b4a2321 |
13 | 3523183c |
14 | 20460d85 |
15 | 13ab8b7a |
hex | cb55949 |
213211465 has 8 divisors (see below), whose sum is σ = 259359048. Its totient is φ = 168232320.
The previous prime is 213211463. The next prime is 213211489. The reversal of 213211465 is 564112312.
It is a happy number.
213211465 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 64834704 + 148376761 = 8052^2 + 12181^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 213211465 - 21 = 213211463 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213211463) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 291706 + ... + 292435.
It is an arithmetic number, because the mean of its divisors is an integer number (32419881).
Almost surely, 2213211465 is an apocalyptic number.
It is an amenable number.
213211465 is a deficient number, since it is larger than the sum of its proper divisors (46147583).
213211465 is an equidigital number, since it uses as much as digits as its factorization.
213211465 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 584219.
The product of its digits is 1440, while the sum is 25.
The square root of 213211465 is about 14601.7623936291. The cubic root of 213211465 is about 597.4068317584.
Adding to 213211465 its reverse (564112312), we get a palindrome (777323777).
The spelling of 213211465 in words is "two hundred thirteen million, two hundred eleven thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •