Base | Representation |
---|---|
bin | 1110100100010000111… |
… | …1011101000111000101 |
3 | 212220221120011212002012 |
4 | 3221010033131013011 |
5 | 13100004232132003 |
6 | 310544210224005 |
7 | 24036334306256 |
oct | 3510417350705 |
9 | 786846155065 |
10 | 250253005253 |
11 | 9714a32a8a9 |
12 | 40601285005 |
13 | 1a7a2614444 |
14 | c180270b2d |
15 | 679a1438d8 |
hex | 3a443dd1c5 |
250253005253 has 8 divisors (see below), whose sum is σ = 250464127872. Its totient is φ = 250041938256.
The previous prime is 250253005237. The next prime is 250253005273. The reversal of 250253005253 is 352500352052.
It is a happy number.
250253005253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 250253005253 - 24 = 250253005237 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (250253005273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17757776 + ... + 17771862.
It is an arithmetic number, because the mean of its divisors is an integer number (31308015984).
Almost surely, 2250253005253 is an apocalyptic number.
It is an amenable number.
250253005253 is a deficient number, since it is larger than the sum of its proper divisors (211122619).
250253005253 is a wasteful number, since it uses less digits than its factorization.
250253005253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27811.
The product of its (nonzero) digits is 45000, while the sum is 32.
The spelling of 250253005253 in words is "two hundred fifty billion, two hundred fifty-three million, five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •