Base | Representation |
---|---|
bin | 11110000111011… |
… | …11111010110100 |
3 | 122121101111020011 |
4 | 33003233322310 |
5 | 1004134002243 |
6 | 41022550004 |
7 | 6155261350 |
oct | 1703577264 |
9 | 577344204 |
10 | 252640948 |
11 | 11a67797a |
12 | 70738304 |
13 | 404587b1 |
14 | 257a6460 |
15 | 172a689d |
hex | f0efeb4 |
252640948 has 48 divisors (see below), whose sum is σ = 549068800. Its totient is φ = 99260640.
The previous prime is 252640943. The next prime is 252640951. The reversal of 252640948 is 849046252.
It is a self number, because there is not a number n which added to its sum of digits gives 252640948.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (252640943) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8833 + ... + 24151.
Almost surely, 2252640948 is an apocalyptic number.
252640948 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 252640948, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (274534400).
252640948 is an abundant number, since it is smaller than the sum of its proper divisors (296427852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
252640948 is a wasteful number, since it uses less digits than its factorization.
252640948 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15380 (or 15378 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 40.
The square root of 252640948 is about 15894.6830103654. The cubic root of 252640948 is about 632.1710167168.
The spelling of 252640948 in words is "two hundred fifty-two million, six hundred forty thousand, nine hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •