Base | Representation |
---|---|
bin | 1100011011101110010… |
… | …1101000000100001010 |
3 | 202102100012012202201120 |
4 | 3012323211220010022 |
5 | 11444423223202310 |
6 | 242043214100110 |
7 | 21301136101005 |
oct | 3067345500412 |
9 | 672305182646 |
10 | 213600600330 |
11 | 82650a74567 |
12 | 354924aa636 |
13 | 171b0c69a90 |
14 | a4a450c53c |
15 | 58524b1b70 |
hex | 31bb96810a |
213600600330 has 32 divisors (see below), whose sum is σ = 552075398784. Its totient is φ = 52578609216.
The previous prime is 213600600319. The next prime is 213600600341. The reversal of 213600600330 is 33006006312.
It is an interprime number because it is at equal distance from previous prime (213600600319) and next prime (213600600341).
It is a super-2 number, since 2×2136006003302 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 213600600330.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 273846534 + ... + 273847313.
It is an arithmetic number, because the mean of its divisors is an integer number (17252356212).
Almost surely, 2213600600330 is an apocalyptic number.
213600600330 is an abundant number, since it is smaller than the sum of its proper divisors (338474798454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213600600330 is a wasteful number, since it uses less digits than its factorization.
213600600330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 547693870.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 213600600330 its reverse (33006006312), we get a palindrome (246606606642).
The spelling of 213600600330 in words is "two hundred thirteen billion, six hundred million, six hundred thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •