Base | Representation |
---|---|
bin | 1110100011110110111… |
… | …1110100110000101101 |
3 | 212220122222011100212122 |
4 | 3220331233310300231 |
5 | 13044243334101341 |
6 | 310525315042325 |
7 | 24033542226152 |
oct | 3507557646055 |
9 | 786588140778 |
10 | 250144050221 |
11 | 970a388231a |
12 | 405908a03a5 |
13 | 1a785b86900 |
14 | c16d9cc229 |
15 | 67907c094b |
hex | 3a3dbf4c2d |
250144050221 has 12 divisors (see below), whose sum is σ = 272683962900. Its totient is φ = 229352497920.
The previous prime is 250144050217. The next prime is 250144050223. The reversal of 250144050221 is 122050441052.
It can be written as a sum of positive squares in 6 ways, for example, as 83296309321 + 166847740900 = 288611^2 + 408470^2 .
It is not a de Polignac number, because 250144050221 - 22 = 250144050217 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (250144050223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4941740 + ... + 4992101.
It is an arithmetic number, because the mean of its divisors is an integer number (22723663575).
Almost surely, 2250144050221 is an apocalyptic number.
It is an amenable number.
250144050221 is a deficient number, since it is larger than the sum of its proper divisors (22539912679).
250144050221 is a wasteful number, since it uses less digits than its factorization.
250144050221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9934016 (or 9934003 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 26.
Adding to 250144050221 its reverse (122050441052), we get a palindrome (372194491273).
The spelling of 250144050221 in words is "two hundred fifty billion, one hundred forty-four million, fifty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •