Base | Representation |
---|---|
bin | 10111110000100100… |
… | …101111100001001101 |
3 | 2102211220110002020002 |
4 | 113300210233201031 |
5 | 404221304001031 |
6 | 15415233134045 |
7 | 1562120631464 |
oct | 276044574115 |
9 | 72756402202 |
10 | 25511000141 |
11 | a901326aa0 |
12 | 4b3b6ba325 |
13 | 2537370473 |
14 | 13401a39db |
15 | 9e49aeccb |
hex | 5f092f84d |
25511000141 has 8 divisors (see below), whose sum is σ = 27832392768. Its totient is φ = 23189976000.
The previous prime is 25511000117. The next prime is 25511000153. The reversal of 25511000141 is 14100011552.
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 25511000141 - 218 = 25510737997 is a prime.
It is a super-2 number, since 2×255110001412 (a number of 22 digits) contains 22 as substring.
It is a pancake number, because a pancake can be divided into 25511000141 parts by 225880 straight cuts.
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 (25511000941) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64181 + ... + 234821.
It is an arithmetic number, because the mean of its divisors is an integer number (3479049096).
Almost surely, 225511000141 is an apocalyptic number.
It is an amenable number.
25511000141 is a deficient number, since it is larger than the sum of its proper divisors (2321392627).
25511000141 is a wasteful number, since it uses less digits than its factorization.
25511000141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 184243.
The product of its (nonzero) digits is 200, while the sum is 20.
Adding to 25511000141 its reverse (14100011552), we get a palindrome (39611011693).
The spelling of 25511000141 in words is "twenty-five billion, five hundred eleven million, one hundred forty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •