Base | Representation |
---|---|
bin | 11101111110001… |
… | …00101000100000 |
3 | 122112002012122100 |
4 | 32333010220200 |
5 | 1003330240242 |
6 | 40540410400 |
7 | 6141664356 |
oct | 1677045040 |
9 | 575065570 |
10 | 251415072 |
11 | 119a0a957 |
12 | 70246a00 |
13 | 4011981c |
14 | 255677d6 |
15 | 1711354c |
hex | efc4a20 |
251415072 has 72 divisors (see below), whose sum is σ = 717276924. Its totient is φ = 83533824.
The previous prime is 251415067. The next prime is 251415089. The reversal of 251415072 is 270514152.
It can be written as a sum of positive squares in 2 ways, for example, as 249766416 + 1648656 = 15804^2 + 1284^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 100428 + ... + 102900.
Almost surely, 2251415072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 251415072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (358638462).
251415072 is an abundant number, since it is smaller than the sum of its proper divisors (465861852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
251415072 is a wasteful number, since it uses less digits than its factorization.
251415072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2842 (or 2831 counting only the distinct ones).
The product of its (nonzero) digits is 2800, while the sum is 27.
The square root of 251415072 is about 15856.0736627956. The cubic root of 251415072 is about 631.1468753932.
The spelling of 251415072 in words is "two hundred fifty-one million, four hundred fifteen thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •