Base | Representation |
---|---|
bin | 111000011000010111… |
… | …1011000111101000101 |
3 | 102120112001101102010000 |
4 | 1300300233120331011 |
5 | 3440431131014022 |
6 | 131342200151513 |
7 | 11514252635523 |
oct | 1606057307505 |
9 | 376461342100 |
10 | 121076813637 |
11 | 4739178314a |
12 | 1b570468599 |
13 | b55730a4c0 |
14 | 5c0836b313 |
15 | 32397ab6ac |
hex | 1c30bd8f45 |
121076813637 has 30 divisors (see below), whose sum is σ = 194798909382. Its totient is φ = 74501859888.
The previous prime is 121076813609. The next prime is 121076813659. The reversal of 121076813637 is 736318670121.
121076813637 is a `hidden beast` number, since 1 + 2 + 1 + 0 + 7 + 6 + 8 + 1 + 3 + 637 = 666.
It can be written as a sum of positive squares in only one way, i.e., 83822409441 + 37254404196 = 289521^2 + 193014^2 .
It is not a de Polignac number, because 121076813637 - 210 = 121076812613 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121076813592 and 121076813601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121076811637) 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 29 ways as a sum of consecutive naturals, for example, 11285958 + ... + 11296680.
Almost surely, 2121076813637 is an apocalyptic number.
It is an amenable number.
121076813637 is a deficient number, since it is larger than the sum of its proper divisors (73722095745).
121076813637 is an frugal number, since it uses more digits than its factorization.
121076813637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21471 (or 10739 counting only the distinct ones).
The product of its (nonzero) digits is 254016, while the sum is 45.
The spelling of 121076813637 in words is "one hundred twenty-one billion, seventy-six million, eight hundred thirteen thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •