Base | Representation |
---|---|
bin | 11101101111010… |
… | …01111011010000 |
3 | 122101102102102112 |
4 | 32313221323100 |
5 | 1002331030142 |
6 | 40431004452 |
7 | 6116315513 |
oct | 1667517320 |
9 | 571372375 |
10 | 249470672 |
11 | 118902010 |
12 | 6b669728 |
13 | 3c8b87a9 |
14 | 251bcd7a |
15 | 16d7c382 |
hex | ede9ed0 |
249470672 has 40 divisors (see below), whose sum is σ = 531489792. Its totient is φ = 112492800.
The previous prime is 249470651. The next prime is 249470677. The reversal of 249470672 is 276074942.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (249470677) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16772 + ... + 27932.
Almost surely, 2249470672 is an apocalyptic number.
249470672 is a gapful number since it is divisible by the number (22) 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 249470672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (265744896).
249470672 is an abundant number, since it is smaller than the sum of its proper divisors (282019120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
249470672 is a wasteful number, since it uses less digits than its factorization.
249470672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11307 (or 11301 counting only the distinct ones).
The product of its (nonzero) digits is 169344, while the sum is 41.
The square root of 249470672 is about 15794.6406100297. The cubic root of 249470672 is about 629.5156031271.
The spelling of 249470672 in words is "two hundred forty-nine million, four hundred seventy thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •