Base | Representation |
---|---|
bin | 111000100000111101… |
… | …0111111001011110111 |
3 | 102121021010210011200111 |
4 | 1301001322333023313 |
5 | 3442023424111422 |
6 | 131430534323451 |
7 | 11524353021040 |
oct | 1610172771367 |
9 | 377233704614 |
10 | 121365066487 |
11 | 4751a463845 |
12 | 1b630ab9587 |
13 | b5a1c54412 |
14 | 5c347638c7 |
15 | 3254c49a77 |
hex | 1c41ebf2f7 |
121365066487 has 16 divisors (see below), whose sum is σ = 138915608832. Its totient is φ = 103867807680.
The previous prime is 121365066467. The next prime is 121365066509. The reversal of 121365066487 is 784660563121.
It is not a de Polignac number, because 121365066487 - 215 = 121365033719 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121365066487.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121365066467) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26830608 + ... + 26835130.
It is an arithmetic number, because the mean of its divisors is an integer number (8682225552).
Almost surely, 2121365066487 is an apocalyptic number.
121365066487 is a deficient number, since it is larger than the sum of its proper divisors (17550542345).
121365066487 is an equidigital number, since it uses as much as digits as its factorization.
121365066487 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9558.
The product of its (nonzero) digits is 1451520, while the sum is 49.
The spelling of 121365066487 in words is "one hundred twenty-one billion, three hundred sixty-five million, sixty-six thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •