Base | Representation |
---|---|
bin | 1100011011000001110… |
… | …0001000001101111111 |
3 | 202101212011021012021221 |
4 | 3012300130020031333 |
5 | 11444032332424330 |
6 | 242012453134211 |
7 | 21263405224321 |
oct | 3066034101577 |
9 | 671764235257 |
10 | 213413561215 |
11 | 82565434288 |
12 | 3543b92a367 |
13 | 1718129cc4a |
14 | a487741611 |
15 | 5840d67b7a |
hex | 31b070837f |
213413561215 has 16 divisors (see below), whose sum is σ = 271576084608. Its totient is φ = 160441739776.
The previous prime is 213413561191. The next prime is 213413561267. The reversal of 213413561215 is 512165314312.
213413561215 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-213413561215 is a prime.
It is a super-2 number, since 2×2134135612152 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1866967 + ... + 1977976.
It is an arithmetic number, because the mean of its divisors is an integer number (16973505288).
Almost surely, 2213413561215 is an apocalyptic number.
213413561215 is a deficient number, since it is larger than the sum of its proper divisors (58162523393).
213413561215 is a wasteful number, since it uses less digits than its factorization.
213413561215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3845618.
The product of its digits is 21600, while the sum is 34.
Adding to 213413561215 its reverse (512165314312), we get a palindrome (725578875527).
The spelling of 213413561215 in words is "two hundred thirteen billion, four hundred thirteen million, five hundred sixty-one thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •