Base | Representation |
---|---|
bin | 111000110010001000… |
… | …1110010111001110101 |
3 | 102122202022101112210202 |
4 | 1301210101302321311 |
5 | 3444214004031322 |
6 | 132004044530245 |
7 | 11544552254144 |
oct | 1614421627165 |
9 | 378668345722 |
10 | 121941470837 |
11 | 4779586597a |
12 | 1b771b50985 |
13 | b6644ab094 |
14 | 5c8b12775b |
15 | 328a656292 |
hex | 1c64472e75 |
121941470837 has 8 divisors (see below), whose sum is σ = 124804363200. Its totient is φ = 119079807840.
The previous prime is 121941470809. The next prime is 121941470867. The reversal of 121941470837 is 738074149121.
It is a happy number.
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 121941470837 - 228 = 121673035381 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121941470791 and 121941470800.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121941470867) 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 7 ways as a sum of consecutive naturals, for example, 105089 + ... + 504902.
It is an arithmetic number, because the mean of its divisors is an integer number (15600545400).
Almost surely, 2121941470837 is an apocalyptic number.
It is an amenable number.
121941470837 is a deficient number, since it is larger than the sum of its proper divisors (2862892363).
121941470837 is an equidigital number, since it uses as much as digits as its factorization.
121941470837 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 614683.
The product of its (nonzero) digits is 338688, while the sum is 47.
The spelling of 121941470837 in words is "one hundred twenty-one billion, nine hundred forty-one million, four hundred seventy thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •