Base | Representation |
---|---|
bin | 111001000011101110… |
… | …0100101011111001001 |
3 | 102201021102122020102201 |
4 | 1302013130211133021 |
5 | 4001421031031100 |
6 | 132142403200201 |
7 | 11565305403532 |
oct | 1620734453711 |
9 | 381242566381 |
10 | 122531502025 |
11 | 47a68925059 |
12 | 1b8b7676061 |
13 | b7297c636a |
14 | 5d05637689 |
15 | 32c235536a |
hex | 1c877257c9 |
122531502025 has 9 divisors (see below), whose sum is σ = 151941232821. Its totient is φ = 98023801440.
The previous prime is 122531501993. The next prime is 122531502047. The reversal of 122531502025 is 520205135221.
The square root of 122531502025 is 350045.
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 31807652409 + 90723849616 = 178347^2 + 301204^2 .
It is not a de Polignac number, because 122531502025 - 25 = 122531501993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122531501984 and 122531502002.
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, 1715221 + ... + 1785229.
Almost surely, 2122531502025 is an apocalyptic number.
122531502025 is the 350045-th square number.
122531502025 is the 175023-rd centered octagonal number.
It is an amenable number.
122531502025 is a deficient number, since it is larger than the sum of its proper divisors (29409730796).
122531502025 is an frugal number, since it uses more digits than its factorization.
122531502025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140028 (or 70014 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 28.
Adding to 122531502025 its reverse (520205135221), we get a palindrome (642736637246).
The spelling of 122531502025 in words is "one hundred twenty-two billion, five hundred thirty-one million, five hundred two thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •