Base | Representation |
---|---|
bin | 11001101000010… |
… | …11011010100010 |
3 | 112222120101012000 |
4 | 30310023122202 |
5 | 420020123314 |
6 | 33200144430 |
7 | 5220340152 |
oct | 1464133242 |
9 | 488511160 |
10 | 215004834 |
11 | 100401350 |
12 | 60008116 |
13 | 3570bbc5 |
14 | 207aa762 |
15 | 13d20209 |
hex | cd0b6a2 |
215004834 has 32 divisors (see below), whose sum is σ = 521225280. Its totient is φ = 65152800.
The previous prime is 215004833. The next prime is 215004841. The reversal of 215004834 is 438400512.
215004834 is digitally balanced in base 3, 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 (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 215004798 and 215004807.
It is not an unprimeable number, because it can be changed into a prime (215004833) 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 15 ways as a sum of consecutive naturals, for example, 180387 + ... + 181574.
It is an arithmetic number, because the mean of its divisors is an integer number (16288290).
Almost surely, 2215004834 is an apocalyptic number.
215004834 is an abundant number, since it is smaller than the sum of its proper divisors (306220446).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
215004834 is a wasteful number, since it uses less digits than its factorization.
215004834 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 361983 (or 361977 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
The square root of 215004834 is about 14663.0431357205. The cubic root of 215004834 is about 599.0771312499.
The spelling of 215004834 in words is "two hundred fifteen million, four thousand, eight hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •