Base | Representation |
---|---|
bin | 111000100001011000… |
… | …0011011011110111001 |
3 | 102121022010010221011021 |
4 | 1301002300123132321 |
5 | 3442041020413100 |
6 | 131432154502441 |
7 | 11524613060134 |
oct | 1610260333671 |
9 | 377263127137 |
10 | 121379076025 |
11 | 47527362379 |
12 | 1b635734a21 |
13 | b5a4b1ac9c |
14 | 5c3656d21b |
15 | 32560b5a1a |
hex | 1c42c1b7b9 |
121379076025 has 27 divisors (see below), whose sum is σ = 153234059053. Its totient is φ = 95376615200.
The previous prime is 121379076023. The next prime is 121379076031. The reversal of 121379076025 is 520670973121.
The square root of 121379076025 is 348395.
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 14387282809 + 106991793216 = 119947^2 + 327096^2 .
It is not a de Polignac number, because 121379076025 - 21 = 121379076023 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121379076023) 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, 102775935 + ... + 102777115.
Almost surely, 2121379076025 is an apocalyptic number.
121379076025 is the 348395-th square number.
121379076025 is the 174198-th centered octagonal number.
It is an amenable number.
121379076025 is a deficient number, since it is larger than the sum of its proper divisors (31854983028).
121379076025 is an frugal number, since it uses more digits than its factorization.
121379076025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2490 (or 1245 counting only the distinct ones).
The product of its (nonzero) digits is 158760, while the sum is 43.
The spelling of 121379076025 in words is "one hundred twenty-one billion, three hundred seventy-nine million, seventy-six thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •