Base | Representation |
---|---|
bin | 111000110100100000… |
… | …1000011101100001001 |
3 | 102122221211222111002111 |
4 | 1301221001003230021 |
5 | 3444344332003400 |
6 | 132020004502321 |
7 | 11546536060651 |
oct | 1615101035411 |
9 | 378854874074 |
10 | 122020969225 |
11 | 47826724221 |
12 | 1b7946aa9a1 |
13 | b677ac404c |
14 | 5c978dd361 |
15 | 329260b3ba |
hex | 1c69043b09 |
122020969225 has 27 divisors (see below), whose sum is σ = 159732046677. Its totient is φ = 92453899680.
The previous prime is 122020969223. The next prime is 122020969277. The reversal of 122020969225 is 522969020221.
The square root of 122020969225 is 349315.
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 3806026249 + 118214942976 = 61693^2 + 343824^2 .
It is not a de Polignac number, because 122020969225 - 21 = 122020969223 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122020969223) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 33183087 + ... + 33186763.
Almost surely, 2122020969225 is an apocalyptic number.
122020969225 is the 349315-th square number.
122020969225 is the 174658-th centered octagonal number.
It is an amenable number.
122020969225 is a deficient number, since it is larger than the sum of its proper divisors (37711077452).
122020969225 is an frugal number, since it uses more digits than its factorization.
122020969225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7402 (or 3701 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 40.
Adding to 122020969225 its reverse (522969020221), we get a palindrome (644989989446).
The spelling of 122020969225 in words is "one hundred twenty-two billion, twenty million, nine hundred sixty-nine thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •