Base | Representation |
---|---|
bin | 11011101001101000001010… |
… | …100100100101010000010111 |
3 | 120221120121012100021010222112 |
4 | 123221220022210211100113 |
5 | 111414410420113142022 |
6 | 1110345520043021235 |
7 | 34420610444341106 |
oct | 3351501244452027 |
9 | 527517170233875 |
10 | 121607881380887 |
11 | 35825681801820 |
12 | 1178050950a81b |
13 | 52b17601335a5 |
14 | 2205bd238803d |
15 | e0d477b038e2 |
hex | 6e9a0a925417 |
121607881380887 has 8 divisors (see below), whose sum is σ = 140466857638032. Its totient is φ = 104049524176000.
The previous prime is 121607881380871. The next prime is 121607881380893. The reversal of 121607881380887 is 788083188706121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121607881380887 - 24 = 121607881380871 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121607881380827) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 325154762864 + ... + 325154763237.
It is an arithmetic number, because the mean of its divisors is an integer number (17558357204754).
Almost surely, 2121607881380887 is an apocalyptic number.
121607881380887 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
121607881380887 is a deficient number, since it is larger than the sum of its proper divisors (18858976257145).
121607881380887 is a wasteful number, since it uses less digits than its factorization.
121607881380887 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 650309526129.
The product of its (nonzero) digits is 57802752, while the sum is 68.
The spelling of 121607881380887 in words is "one hundred twenty-one trillion, six hundred seven billion, eight hundred eighty-one million, three hundred eighty thousand, eight hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •