Base | Representation |
---|---|
bin | 111110101101000… |
… | …1011101100001001 |
3 | 12102122002001211122 |
4 | 1331122023230021 |
5 | 13302112000000 |
6 | 544440205025 |
7 | 103065560225 |
oct | 17532135411 |
9 | 5378061748 |
10 | 2104015625 |
11 | 98a731098 |
12 | 4a8769775 |
13 | 276b9587a |
14 | 15d613785 |
15 | c4aac085 |
hex | 7d68bb09 |
2104015625 has 42 divisors (see below), whose sum is σ = 2816331138. Its totient is φ = 1566400000.
The previous prime is 2104015607. The next prime is 2104015637. The reversal of 2104015625 is 5265104012.
It can be written as a sum of positive squares in 21 ways, for example, as 609497344 + 1494518281 = 24688^2 + 38659^2 .
It is not a de Polignac number, because 2104015625 - 212 = 2104011529 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2104015594 and 2104015603.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 41 ways as a sum of consecutive naturals, for example, 23640581 + ... + 23640669.
Almost surely, 22104015625 is an apocalyptic number.
2104015625 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2104015625 is a deficient number, since it is larger than the sum of its proper divisors (712315513).
2104015625 is an frugal number, since it uses more digits than its factorization.
2104015625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225 (or 111 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 2104015625 is about 45869.5500849965. The cubic root of 2104015625 is about 1281.3948874422.
Adding to 2104015625 its reverse (5265104012), we get a palindrome (7369119637).
The spelling of 2104015625 in words is "two billion, one hundred four million, fifteen thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •