Base | Representation |
---|---|
bin | 100110001101001001000… |
… | …1111001111100101001001 |
3 | 200120222111111022210200221 |
4 | 1030122102033033211021 |
5 | 1142012322244131400 |
6 | 15100122021230041 |
7 | 1051236166240000 |
oct | 114322217174511 |
9 | 20528444283627 |
10 | 5250903505225 |
11 | 1744994157644 |
12 | 7097b0b62321 |
13 | 2c12093a6121 |
14 | 142206187c37 |
15 | 918c4a0ac1a |
hex | 4c6923cf949 |
5250903505225 has 135 divisors (see below), whose sum is σ = 7800103144167. Its totient is φ = 3506302023840.
The previous prime is 5250903505217. The next prime is 5250903505291. The reversal of 5250903505225 is 5225053090525.
The square root of 5250903505225 is 2291485.
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., 1890325261881 + 3360578243344 = 1374891^2 + 1833188^2 .
It is not a de Polignac number, because 5250903505225 - 23 = 5250903505217 is a prime.
It is a super-3 number, since 3×52509035052253 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 134 ways as a sum of consecutive naturals, for example, 26386449676 + ... + 26386449874.
Almost surely, 25250903505225 is an apocalyptic number.
5250903505225 is the 2291485-th square number.
5250903505225 is the 1145743-rd centered octagonal number.
It is an amenable number.
5250903505225 is a deficient number, since it is larger than the sum of its proper divisors (2549199638942).
5250903505225 is an frugal number, since it uses more digits than its factorization.
5250903505225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 530 (or 258 counting only the distinct ones).
The product of its (nonzero) digits is 675000, while the sum is 43.
The spelling of 5250903505225 in words is "five trillion, two hundred fifty billion, nine hundred three million, five hundred five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •