Base | Representation |
---|---|
bin | 10111011000010100… |
… | …110000001000000101 |
3 | 2101210112220012210202 |
4 | 113120110300020011 |
5 | 402403130431031 |
6 | 15311021100245 |
7 | 1546050540452 |
oct | 273024601005 |
9 | 71715805722 |
10 | 25104155141 |
11 | a71270635a |
12 | 4a473b7685 |
13 | 24a0ca3390 |
14 | 130213a829 |
15 | 9bdde82cb |
hex | 5d8530205 |
25104155141 has 4 divisors (see below), whose sum is σ = 27035244012. Its totient is φ = 23173066272.
The previous prime is 25104155129. The next prime is 25104155159. The reversal of 25104155141 is 14155140152.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5348728225 + 19755426916 = 73135^2 + 140554^2 .
It is a cyclic number.
It is not a de Polignac number, because 25104155141 - 26 = 25104155077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25104155191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 965544416 + ... + 965544441.
It is an arithmetic number, because the mean of its divisors is an integer number (6758811003).
Almost surely, 225104155141 is an apocalyptic number.
It is an amenable number.
25104155141 is a deficient number, since it is larger than the sum of its proper divisors (1931088871).
25104155141 is a wasteful number, since it uses less digits than its factorization.
25104155141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1931088870.
The product of its (nonzero) digits is 4000, while the sum is 29.
Adding to 25104155141 its reverse (14155140152), we get a palindrome (39259295293).
The spelling of 25104155141 in words is "twenty-five billion, one hundred four million, one hundred fifty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •