Base | Representation |
---|---|
bin | 111000100010100100… |
… | …1111011110101101101 |
3 | 102121101220212100211112 |
4 | 1301011021323311231 |
5 | 3442131321112324 |
6 | 131440153201405 |
7 | 11525612106434 |
oct | 1610511736555 |
9 | 377356770745 |
10 | 121419316589 |
11 | 4754804773a |
12 | 1b647100265 |
13 | b5b026a17c |
14 | 5c3ba4611b |
15 | 32598b3c0e |
hex | 1c4527bd6d |
121419316589 has 4 divisors (see below), whose sum is σ = 121433860956. Its totient is φ = 121404772224.
The previous prime is 121419316567. The next prime is 121419316657. The reversal of 121419316589 is 985613914121.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 95445159364 + 25974157225 = 308942^2 + 161165^2 .
It is a cyclic number.
It is not a de Polignac number, because 121419316589 - 212 = 121419312493 is a prime.
It is a super-3 number, since 3×1214193165893 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121419316519) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7259654 + ... + 7276359.
It is an arithmetic number, because the mean of its divisors is an integer number (30358465239).
Almost surely, 2121419316589 is an apocalyptic number.
It is an amenable number.
121419316589 is a deficient number, since it is larger than the sum of its proper divisors (14544367).
121419316589 is an equidigital number, since it uses as much as digits as its factorization.
121419316589 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14544366.
The product of its digits is 466560, while the sum is 50.
The spelling of 121419316589 in words is "one hundred twenty-one billion, four hundred nineteen million, three hundred sixteen thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •