Base | Representation |
---|---|
bin | 11101111110110… |
… | …10101000000000 |
3 | 122112020210012122 |
4 | 32333122220000 |
5 | 1003341131102 |
6 | 40542343412 |
7 | 6142521113 |
oct | 1677325000 |
9 | 575223178 |
10 | 251505152 |
11 | 119a715a8 |
12 | 7028ab68 |
13 | 4014b822 |
14 | 2558c57a |
15 | 171300a2 |
hex | efdaa00 |
251505152 has 40 divisors (see below), whose sum is σ = 514818612. Its totient is φ = 122675200.
The previous prime is 251505127. The next prime is 251505179.
251505152 is nontrivially palindromic in base 10.
251505152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 251412736 + 92416 = 15856^2 + 304^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15002 + ... + 26982.
Almost surely, 2251505152 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 251505152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (257409306).
251505152 is an abundant number, since it is smaller than the sum of its proper divisors (263313460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
251505152 is an equidigital number, since it uses as much as digits as its factorization.
251505152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12040 (or 12024 counting only the distinct ones).
The product of its (nonzero) digits is 2500, while the sum is 26.
The square root of 251505152 is about 15858.9139602938. The cubic root of 251505152 is about 631.2222446771. Note that the first 4 decimals are identical.
The spelling of 251505152 in words is "two hundred fifty-one million, five hundred five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •