Base | Representation |
---|---|
bin | 111000101011110111… |
… | …1001001101001010001 |
3 | 102122012122110200121221 |
4 | 1301113233021221101 |
5 | 3443301122443403 |
6 | 131531131045041 |
7 | 11536415646265 |
oct | 1612757115121 |
9 | 378178420557 |
10 | 121731062353 |
11 | 4769801396a |
12 | 1b7135a0781 |
13 | b62ca1b314 |
14 | 5c6b1d60a5 |
15 | 3276e42dbd |
hex | 1c57bc9a51 |
121731062353 has 4 divisors (see below), whose sum is σ = 125657870848. Its totient is φ = 117804253860.
The previous prime is 121731062347. The next prime is 121731062413. The reversal of 121731062353 is 353260137121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 353260137121 = 293 ⋅1205665997.
It is a cyclic number.
It is not a de Polignac number, because 121731062353 - 29 = 121731061841 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121731065353) 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, 1963404201 + ... + 1963404262.
It is an arithmetic number, because the mean of its divisors is an integer number (31414467712).
Almost surely, 2121731062353 is an apocalyptic number.
It is an amenable number.
121731062353 is a deficient number, since it is larger than the sum of its proper divisors (3926808495).
121731062353 is an equidigital number, since it uses as much as digits as its factorization.
121731062353 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3926808494.
The product of its (nonzero) digits is 22680, while the sum is 34.
Adding to 121731062353 its reverse (353260137121), we get a palindrome (474991199474).
The spelling of 121731062353 in words is "one hundred twenty-one billion, seven hundred thirty-one million, sixty-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •