Base | Representation |
---|---|
bin | 11001101101001… |
… | …00000110101010 |
3 | 120000202011002120 |
4 | 30312210012222 |
5 | 420200132000 |
6 | 33221412110 |
7 | 5225553423 |
oct | 1466440652 |
9 | 500664076 |
10 | 215630250 |
11 | 100799220 |
12 | 6026a036 |
13 | 3589a784 |
14 | 208d064a |
15 | 13de56a0 |
hex | cda41aa |
215630250 has 128 divisors (see below), whose sum is σ = 598440960. Its totient is φ = 51272000.
The previous prime is 215630249. The next prime is 215630269. The reversal of 215630250 is 52036512.
It is a self number, because there is not a number n which added to its sum of digits gives 215630250.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 486529 + ... + 486971.
It is an arithmetic number, because the mean of its divisors is an integer number (4675320).
Almost surely, 2215630250 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 215630250, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (299220480).
215630250 is an abundant number, since it is smaller than the sum of its proper divisors (382810710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
215630250 is a wasteful number, since it uses less digits than its factorization.
215630250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 533 (or 523 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 24.
The square root of 215630250 is about 14684.3539183718. The cubic root of 215630250 is about 599.6574433510.
Adding to 215630250 its reverse (52036512), we get a palindrome (267666762).
The spelling of 215630250 in words is "two hundred fifteen million, six hundred thirty thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •