Base | Representation |
---|---|
bin | 1110100011011010001… |
… | …0001101011000001101 |
3 | 212220100112110102210001 |
4 | 3220312202031120031 |
5 | 13044021344244100 |
6 | 310505313244301 |
7 | 24030542531206 |
oct | 3506642153015 |
9 | 786315412701 |
10 | 250023040525 |
11 | 97041540a05 |
12 | 40558263691 |
13 | 1a766a9823b |
14 | c15b8cc5ad |
15 | 6784d6ad6a |
hex | 3a3688d60d |
250023040525 has 12 divisors (see below), whose sum is σ = 314395172064. Its totient is φ = 197201270000.
The previous prime is 250023040523. The next prime is 250023040537. The reversal of 250023040525 is 525040320052.
It is not a de Polignac number, because 250023040525 - 21 = 250023040523 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 250023040493 and 250023040502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (250023040523) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 70427251 + ... + 70430800.
It is an arithmetic number, because the mean of its divisors is an integer number (26199597672).
Almost surely, 2250023040525 is an apocalyptic number.
250023040525 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
250023040525 is a deficient number, since it is larger than the sum of its proper divisors (64372131539).
250023040525 is a wasteful number, since it uses less digits than its factorization.
250023040525 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140858132 (or 140858127 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 28.
Adding to 250023040525 its reverse (525040320052), we get a palindrome (775063360577).
The spelling of 250023040525 in words is "two hundred fifty billion, twenty-three million, forty thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •