Base | Representation |
---|---|
bin | 10111011000010100… |
… | …001011010100001001 |
3 | 2101210112121112222022 |
4 | 113120110023110021 |
5 | 402403111114421 |
6 | 15311013534225 |
7 | 1546046342042 |
oct | 273024132411 |
9 | 71715545868 |
10 | 25104004361 |
11 | a712613047 |
12 | 4a47344375 |
13 | 24a0c4c867 |
14 | 13020db8c9 |
15 | 9bddb87ab |
hex | 5d850b509 |
25104004361 has 4 divisors (see below), whose sum is σ = 25108328772. Its totient is φ = 25099679952.
The previous prime is 25104004357. The next prime is 25104004379. The reversal of 25104004361 is 16340040152.
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 11568078025 + 13535926336 = 107555^2 + 116344^2 .
It is a cyclic number.
It is not a de Polignac number, because 25104004361 - 22 = 25104004357 is a prime.
It is a super-2 number, since 2×251040043612 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 25104004361.
It is not an unprimeable number, because it can be changed into a prime (25104004301) 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, 2153486 + ... + 2165111.
It is an arithmetic number, because the mean of its divisors is an integer number (6277082193).
Almost surely, 225104004361 is an apocalyptic number.
It is an amenable number.
25104004361 is a deficient number, since it is larger than the sum of its proper divisors (4324411).
25104004361 is an equidigital number, since it uses as much as digits as its factorization.
25104004361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4324410.
The product of its (nonzero) digits is 2880, while the sum is 26.
The spelling of 25104004361 in words is "twenty-five billion, one hundred four million, four thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •