Base | Representation |
---|---|
bin | 11011101001111101110101… |
… | …101000111011110101100111 |
3 | 120221122211021011000112021011 |
4 | 123221331311220323311213 |
5 | 111420301100021124201 |
6 | 1110404325144203051 |
7 | 34422363226636252 |
oct | 3351756550736547 |
9 | 527584234015234 |
10 | 121631152520551 |
11 | 35834533753453 |
12 | 11784b22a69487 |
13 | 52b39cb42720b |
14 | 2206d9cc96099 |
15 | e0dd8ab21151 |
hex | 6e9f75a3bd67 |
121631152520551 has 8 divisors (see below), whose sum is σ = 124600808690064. Its totient is φ = 118661641241280.
The previous prime is 121631152520539. The next prime is 121631152520561. The reversal of 121631152520551 is 155025251136121.
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 121631152520551 - 29 = 121631152520039 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 (121631152520561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34522161 + ... + 37881946.
It is an arithmetic number, because the mean of its divisors is an integer number (15575101086258).
Almost surely, 2121631152520551 is an apocalyptic number.
121631152520551 is a deficient number, since it is larger than the sum of its proper divisors (2969656169513).
121631152520551 is an equidigital number, since it uses as much as digits as its factorization.
121631152520551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72445121.
The product of its (nonzero) digits is 90000, while the sum is 40.
The spelling of 121631152520551 in words is "one hundred twenty-one trillion, six hundred thirty-one billion, one hundred fifty-two million, five hundred twenty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •