Base | Representation |
---|---|
bin | 11001101000100… |
… | …11000101011010 |
3 | 112222121222021120 |
4 | 30310103011122 |
5 | 420022130000 |
6 | 33200550110 |
7 | 5220530562 |
oct | 1464230532 |
9 | 488558246 |
10 | 215036250 |
11 | 100422a10 |
12 | 60022336 |
13 | 357202b0 |
14 | 207b7da2 |
15 | 13d296a0 |
hex | cd1315a |
215036250 has 160 divisors (see below), whose sum is σ = 632947392. Its totient is φ = 48000000.
The previous prime is 215036203. The next prime is 215036251. The reversal of 215036250 is 52630512.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 215036250.
It is not an unprimeable number, because it can be changed into a prime (215036251) by changing a digit.
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 79 ways as a sum of consecutive naturals, for example, 536050 + ... + 536450.
Almost surely, 2215036250 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 215036250, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (316473696).
215036250 is an abundant number, since it is smaller than the sum of its proper divisors (417911142).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
215036250 is a wasteful number, since it uses less digits than its factorization.
215036250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 450 (or 435 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 24.
The square root of 215036250 is about 14664.1143612562. The cubic root of 215036250 is about 599.1063084087.
Adding to 215036250 its reverse (52630512), we get a palindrome (267666762).
The spelling of 215036250 in words is "two hundred fifteen million, thirty-six thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •