Base | Representation |
---|---|
bin | 100011000001110001… |
… | …0011100110011110001 |
3 | 21012011022010110120001 |
4 | 1012003202130303301 |
5 | 2213023122241400 |
6 | 54320045150001 |
7 | 5302024263064 |
oct | 1060342346361 |
9 | 235138113501 |
10 | 75221290225 |
11 | 299a0503764 |
12 | 126b355b301 |
13 | 712a0a5cb3 |
14 | 38d823c8db |
15 | 1e53bc9a6a |
hex | 118389ccf1 |
75221290225 has 27 divisors (see below), whose sum is σ = 98476066827. Its totient is φ = 56990072880.
The previous prime is 75221290169. The next prime is 75221290237. The reversal of 75221290225 is 52209212257.
The square root of 75221290225 is 274265.
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., 27079664481 + 48141625744 = 164559^2 + 219412^2 .
It is a de Polignac number, because none of the positive numbers 2k-75221290225 is a prime.
It is a super-2 number, since 2×752212902252 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
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 26 ways as a sum of consecutive naturals, for example, 26053732 + ... + 26056618.
Almost surely, 275221290225 is an apocalyptic number.
75221290225 is the 274265-th square number.
75221290225 is the 137133-rd centered octagonal number.
It is an amenable number.
75221290225 is a deficient number, since it is larger than the sum of its proper divisors (23254776602).
75221290225 is an frugal number, since it uses more digits than its factorization.
75221290225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5822 (or 2911 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 37.
The spelling of 75221290225 in words is "seventy-five billion, two hundred twenty-one million, two hundred ninety thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •