Base | Representation |
---|---|
bin | 11001011011000… |
… | …00110101001110 |
3 | 112212021121100210 |
4 | 30231200311032 |
5 | 414043220200 |
6 | 33054503250 |
7 | 5166442062 |
oct | 1455406516 |
9 | 485247323 |
10 | 213257550 |
11 | aa418610 |
12 | 5b504b26 |
13 | 352497cc |
14 | 20473aa2 |
15 | 13ac7650 |
hex | cb60d4e |
213257550 has 96 divisors (see below), whose sum is σ = 580212864. Its totient is φ = 51408000.
The previous prime is 213257543. The next prime is 213257567. The reversal of 213257550 is 55752312.
213257550 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 506340 + ... + 506760.
It is an arithmetic number, because the mean of its divisors is an integer number (6043884).
Almost surely, 2213257550 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 213257550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (290106432).
213257550 is an abundant number, since it is smaller than the sum of its proper divisors (366955314).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213257550 is a wasteful number, since it uses less digits than its factorization.
213257550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 754 (or 749 counting only the distinct ones).
The product of its (nonzero) digits is 10500, while the sum is 30.
The square root of 213257550 is about 14603.3403712986. The cubic root of 213257550 is about 597.4498712051.
The spelling of 213257550 in words is "two hundred thirteen million, two hundred fifty-seven thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •