Base | Representation |
---|---|
bin | 111000011000001011… |
… | …1111000011101011001 |
3 | 102120111121210022212112 |
4 | 1300300113320131121 |
5 | 3440423041314400 |
6 | 131341420122105 |
7 | 11514146361356 |
oct | 1606027703531 |
9 | 376447708775 |
10 | 121070651225 |
11 | 47389254247 |
12 | 1b56a396335 |
13 | b555c605c4 |
14 | 5c0760562d |
15 | 3238e90835 |
hex | 1c305f8759 |
121070651225 has 12 divisors (see below), whose sum is σ = 150140333484. Its totient is φ = 96848310720.
The previous prime is 121070651167. The next prime is 121070651227. The reversal of 121070651225 is 522156070121.
It can be written as a sum of positive squares in 6 ways, for example, as 363741184 + 120706910041 = 19072^2 + 347429^2 .
It is not a de Polignac number, because 121070651225 - 220 = 121069602649 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121070651191 and 121070651200.
It is not an unprimeable number, because it can be changed into a prime (121070651227) 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 11 ways as a sum of consecutive naturals, for example, 104747 + ... + 503103.
It is an arithmetic number, because the mean of its divisors is an integer number (12511694457).
Almost surely, 2121070651225 is an apocalyptic number.
It is an amenable number.
121070651225 is a deficient number, since it is larger than the sum of its proper divisors (29069682259).
121070651225 is a wasteful number, since it uses less digits than its factorization.
121070651225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410524 (or 410519 counting only the distinct ones).
The product of its (nonzero) digits is 8400, while the sum is 32.
The spelling of 121070651225 in words is "one hundred twenty-one billion, seventy million, six hundred fifty-one thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •