Base | Representation |
---|---|
bin | 11011100101101001010010… |
… | …000101001110001010010010 |
3 | 120220121102210020111201001022 |
4 | 123211221102011032022102 |
5 | 111400414422010244214 |
6 | 1110020055150035442 |
7 | 34362051444315212 |
oct | 3345512205161222 |
9 | 526542706451038 |
10 | 121334203212434 |
11 | 3572a6015a0113 |
12 | 1173746b1a8b82 |
13 | 52919c664b144 |
14 | 21d686cd94242 |
15 | e062ab1bad8e |
hex | 6e5a5214e292 |
121334203212434 has 8 divisors (see below), whose sum is σ = 184717742204208. Its totient is φ = 59761622477700.
The previous prime is 121334203212421. The next prime is 121334203212451. The reversal of 121334203212434 is 434212302433121.
It is a happy number.
121334203212434 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 121334203212394 and 121334203212403.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 452739564092 + ... + 452739564359.
It is an arithmetic number, because the mean of its divisors is an integer number (23089717775526).
Almost surely, 2121334203212434 is an apocalyptic number.
121334203212434 is a deficient number, since it is larger than the sum of its proper divisors (63383538991774).
121334203212434 is an equidigital number, since it uses as much as digits as its factorization.
121334203212434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 905479128520.
The product of its (nonzero) digits is 82944, while the sum is 35.
Adding to 121334203212434 its reverse (434212302433121), we get a palindrome (555546505645555).
The spelling of 121334203212434 in words is "one hundred twenty-one trillion, three hundred thirty-four billion, two hundred three million, two hundred twelve thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •