Base | Representation |
---|---|
bin | 101010100100001110000… |
… | …101010000010010010001 |
3 | 101100122012212121122002211 |
4 | 222210032011100102101 |
5 | 340411110400041100 |
6 | 10115435421112121 |
7 | 421221633102301 |
oct | 52441605202221 |
9 | 11318185548084 |
10 | 2925108987025 |
11 | a28593847225 |
12 | 3b2aa50b8641 |
13 | 182ab4cc5c44 |
14 | a180c8ad601 |
15 | 5114ea591ba |
hex | 2a90e150491 |
2925108987025 has 9 divisors (see below), whose sum is σ = 3627145747771. Its totient is φ = 2340080348440.
The previous prime is 2925108986999. The next prime is 2925108987079. The reversal of 2925108987025 is 5207898015292.
The square root of 2925108987025 is 1710295.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 1053039235329 + 1872069751696 = 1026177^2 + 1368236^2 .
It is not a de Polignac number, because 2925108987025 - 27 = 2925108986897 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 8380446 + ... + 8722504.
Almost surely, 22925108987025 is an apocalyptic number.
2925108987025 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
2925108987025 is the 1710295-th square number.
2925108987025 is the 855148-th centered octagonal number.
It is an amenable number.
2925108987025 is a deficient number, since it is larger than the sum of its proper divisors (702036760746).
2925108987025 is an frugal number, since it uses more digits than its factorization.
2925108987025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 684128 (or 342064 counting only the distinct ones).
The product of its (nonzero) digits is 7257600, while the sum is 58.
The spelling of 2925108987025 in words is "two trillion, nine hundred twenty-five billion, one hundred eight million, nine hundred eighty-seven thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •