Base | Representation |
---|---|
bin | 1011011001000100010010… |
… | …11101110001010100011101 |
3 | 10021200210212021202211012210 |
4 | 11230202021131301110131 |
5 | 11240412014210144203 |
6 | 125140022155351033 |
7 | 5163562055630022 |
oct | 554421135612435 |
9 | 107623767684183 |
10 | 25050555553053 |
11 | 7a889765a78a8 |
12 | 2986b70452479 |
13 | 10c9346250924 |
14 | 62864c02b549 |
15 | 2d6950ada803 |
hex | 16c88977151d |
25050555553053 has 4 divisors (see below), whose sum is σ = 33400740737408. Its totient is φ = 16700370368700.
The previous prime is 25050555553013. The next prime is 25050555553117. The reversal of 25050555553053 is 35035555505052.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 25050555553053 - 212 = 25050555548957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 25050555552993 and 25050555553011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25050555553013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4175092592173 + ... + 4175092592178.
It is an arithmetic number, because the mean of its divisors is an integer number (8350185184352).
Almost surely, 225050555553053 is an apocalyptic number.
It is an amenable number.
25050555553053 is a deficient number, since it is larger than the sum of its proper divisors (8350185184355).
25050555553053 is an equidigital number, since it uses as much as digits as its factorization.
25050555553053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8350185184354.
The product of its (nonzero) digits is 7031250, while the sum is 48.
The spelling of 25050555553053 in words is "twenty-five trillion, fifty billion, five hundred fifty-five million, five hundred fifty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •