Base | Representation |
---|---|
bin | 101111101000110100… |
… | …000101001101111001 |
3 | 11220000202220002000021 |
4 | 233220310011031321 |
5 | 1314224023412400 |
6 | 35255343010441 |
7 | 3460362662524 |
oct | 575064051571 |
9 | 156022802007 |
10 | 51150607225 |
11 | 1a769203313 |
12 | 9ab6299a21 |
13 | 4a9225c2c3 |
14 | 2693483bbb |
15 | 14e58c571a |
hex | be8d05379 |
51150607225 has 9 divisors (see below), whose sum is σ = 63428155213. Its totient is φ = 40919581120.
The previous prime is 51150607223. The next prime is 51150607243. The reversal of 51150607225 is 52270605115.
The square root of 51150607225 is 226165.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 11052947689 + 40097659536 = 105133^2 + 200244^2 .
It is not a de Polignac number, because 51150607225 - 21 = 51150607223 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51150607223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1108209 + ... + 1153441.
Almost surely, 251150607225 is an apocalyptic number.
51150607225 is the 226165-th square number.
51150607225 is the 113083-rd centered octagonal number.
It is an amenable number.
51150607225 is a deficient number, since it is larger than the sum of its proper divisors (12277547988).
51150607225 is an frugal number, since it uses more digits than its factorization.
51150607225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90476 (or 45238 counting only the distinct ones).
The product of its (nonzero) digits is 21000, while the sum is 34.
The spelling of 51150607225 in words is "fifty-one billion, one hundred fifty million, six hundred seven thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •