Base | Representation |
---|---|
bin | 1110100011010101111… |
… | …0010110000000000101 |
3 | 212220022021222120211200 |
4 | 3220311132112000011 |
5 | 13044002321000203 |
6 | 310503440053113 |
7 | 24030235364016 |
oct | 3506536260005 |
9 | 786267876750 |
10 | 250005250053 |
11 | 9703249a739 |
12 | 40552304199 |
13 | 1a7631a9730 |
14 | c1593bb00d |
15 | 67835049a3 |
hex | 3a35796005 |
250005250053 has 12 divisors (see below), whose sum is σ = 388897055820. Its totient is φ = 153849384576.
The previous prime is 250005249997. The next prime is 250005250057. The reversal of 250005250053 is 350052500052.
It can be written as a sum of positive squares in 2 ways, for example, as 18252550404 + 231752699649 = 135102^2 + 481407^2 .
It is not a de Polignac number, because 250005250053 - 210 = 250005249029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 250005249999 and 250005250026.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (250005250057) 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 11 ways as a sum of consecutive naturals, for example, 1068398388 + ... + 1068398621.
It is an arithmetic number, because the mean of its divisors is an integer number (32408087985).
Almost surely, 2250005250053 is an apocalyptic number.
It is an amenable number.
250005250053 is a deficient number, since it is larger than the sum of its proper divisors (138891805767).
250005250053 is a wasteful number, since it uses less digits than its factorization.
250005250053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2136797028 (or 2136797025 counting only the distinct ones).
The product of its (nonzero) digits is 7500, while the sum is 27.
The spelling of 250005250053 in words is "two hundred fifty billion, five million, two hundred fifty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •