Base | Representation |
---|---|
bin | 111000110110100101… |
… | …1100110100001110001 |
3 | 102200010201110101211101 |
4 | 1301231023212201301 |
5 | 4000020223422400 |
6 | 132030542244401 |
7 | 11551345015222 |
oct | 1615513464161 |
9 | 380121411741 |
10 | 122090842225 |
11 | 47862108900 |
12 | 1b7b3b86701 |
13 | b689419b11 |
14 | 5ca2ccb249 |
15 | 329880e56a |
hex | 1c6d2e6871 |
122090842225 has 27 divisors (see below), whose sum is σ = 166432988449. Its totient is φ = 88779363200.
The previous prime is 122090842213. The next prime is 122090842229. The reversal of 122090842225 is 522248090221.
The square root of 122090842225 is 349415.
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 4032631009 + 118058211216 = 63503^2 + 343596^2 .
It is not a de Polignac number, because 122090842225 - 29 = 122090841713 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122090842229) 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 26 ways as a sum of consecutive naturals, for example, 19214649 + ... + 19221001.
Almost surely, 2122090842225 is an apocalyptic number.
122090842225 is the 349415-th square number.
122090842225 is the 174708-th centered octagonal number.
It is an amenable number.
122090842225 is a deficient number, since it is larger than the sum of its proper divisors (44342146224).
122090842225 is an frugal number, since it uses more digits than its factorization.
122090842225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12738 (or 6369 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 37.
The spelling of 122090842225 in words is "one hundred twenty-two billion, ninety million, eight hundred forty-two thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •