Base | Representation |
---|---|
bin | 11001011101111… |
… | …11100010001010 |
3 | 112220000022110110 |
4 | 30232333202022 |
5 | 414143123300 |
6 | 33111055150 |
7 | 5202646014 |
oct | 1456774212 |
9 | 486008413 |
10 | 213645450 |
11 | aa662a97 |
12 | 5b6714b6 |
13 | 35354235 |
14 | 205351b4 |
15 | 13b52550 |
hex | cbbf88a |
213645450 has 96 divisors (see below), whose sum is σ = 545054400. Its totient is φ = 55365120.
The previous prime is 213645361. The next prime is 213645451. The reversal of 213645450 is 54546312.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (213645451) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1193461 + ... + 1193639.
It is an arithmetic number, because the mean of its divisors is an integer number (5677650).
Almost surely, 2213645450 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 213645450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (272527200).
213645450 is an abundant number, since it is smaller than the sum of its proper divisors (331408950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213645450 is a wasteful number, since it uses less digits than its factorization.
213645450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 376 (or 371 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
The square root of 213645450 is about 14616.6155453306. The cubic root of 213645450 is about 597.8118911105.
It can be divided in two parts, 2136 and 45450, that added together give a triangular number (47586 = T308).
The spelling of 213645450 in words is "two hundred thirteen million, six hundred forty-five thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •