Base | Representation |
---|---|
bin | 111000100111100011… |
… | …1101001110010110101 |
3 | 102121211120102200101200 |
4 | 1301033013221302311 |
5 | 3443002120144144 |
6 | 131504524243113 |
7 | 11533012055166 |
oct | 1611707516265 |
9 | 377746380350 |
10 | 121586490549 |
11 | 47623449a37 |
12 | 1b6930a0499 |
13 | b608aa0084 |
14 | 5c55d2176d |
15 | 32693d6c69 |
hex | 1c4f1e9cb5 |
121586490549 has 6 divisors (see below), whose sum is σ = 175624930806. Its totient is φ = 81057660360.
The previous prime is 121586490521. The next prime is 121586490569. The reversal of 121586490549 is 945094685121.
121586490549 is a `hidden beast` number, since 1 + 2 + 1 + 5 + 8 + 6 + 4 + 90 + 549 = 666.
It can be written as a sum of positive squares in only one way, i.e., 117848024100 + 3738466449 = 343290^2 + 61143^2 .
It is not a de Polignac number, because 121586490549 - 29 = 121586490037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121586490495 and 121586490504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121586490569) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6754805022 + ... + 6754805039.
It is an arithmetic number, because the mean of its divisors is an integer number (29270821801).
Almost surely, 2121586490549 is an apocalyptic number.
It is an amenable number.
121586490549 is a deficient number, since it is larger than the sum of its proper divisors (54038440257).
121586490549 is a wasteful number, since it uses less digits than its factorization.
121586490549 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13509610067 (or 13509610064 counting only the distinct ones).
The product of its (nonzero) digits is 3110400, while the sum is 54.
The spelling of 121586490549 in words is "one hundred twenty-one billion, five hundred eighty-six million, four hundred ninety thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •