Base | Representation |
---|---|
bin | 11101111011010… |
… | …10110010001101 |
3 | 122111101111211000 |
4 | 32331222302031 |
5 | 1003232001203 |
6 | 40524450513 |
7 | 6135602415 |
oct | 1675526215 |
9 | 574344730 |
10 | 251047053 |
11 | 119789404 |
12 | 700a9a39 |
13 | 4001b16a |
14 | 254ad645 |
15 | 1708e4a3 |
hex | ef6ac8d |
251047053 has 8 divisors (see below), whose sum is σ = 371921600. Its totient is φ = 167364684.
The previous prime is 251047037. The next prime is 251047067. The reversal of 251047053 is 350740152.
It is a happy number.
It is not a de Polignac number, because 251047053 - 24 = 251047037 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 9298039 = 251047053 / (2 + 5 + 1 + 0 + 4 + 7 + 0 + 5 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (251046053) 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, 4648993 + ... + 4649046.
It is an arithmetic number, because the mean of its divisors is an integer number (46490200).
Almost surely, 2251047053 is an apocalyptic number.
It is an amenable number.
251047053 is a deficient number, since it is larger than the sum of its proper divisors (120874547).
251047053 is an equidigital number, since it uses as much as digits as its factorization.
251047053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9298048 (or 9298042 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 251047053 is about 15844.4644276795. The cubic root of 251047053 is about 630.8387694049.
The spelling of 251047053 in words is "two hundred fifty-one million, forty-seven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •