Base | Representation |
---|---|
bin | 111000011010010010… |
… | …0101010011000111111 |
3 | 102120200112101000121012 |
4 | 1300310210222120333 |
5 | 3441044111012320 |
6 | 131352414225435 |
7 | 11515663306460 |
oct | 1606444523077 |
9 | 376615330535 |
10 | 121141110335 |
11 | 47414aa9213 |
12 | 1b589ab527b |
13 | b56773009b |
14 | 5c12b06d67 |
15 | 324025c4c5 |
hex | 1c3492a63f |
121141110335 has 16 divisors (see below), whose sum is σ = 166923766272. Its totient is φ = 82674496800.
The previous prime is 121141110329. The next prime is 121141110367. The reversal of 121141110335 is 533011141121.
It is a de Polignac number, because none of the positive numbers 2k-121141110335 is a prime.
It is a super-3 number, since 3×1211411103353 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121141110335.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 8194451 + ... + 8209220.
It is an arithmetic number, because the mean of its divisors is an integer number (10432735392).
Almost surely, 2121141110335 is an apocalyptic number.
121141110335 is a deficient number, since it is larger than the sum of its proper divisors (45782655937).
121141110335 is a wasteful number, since it uses less digits than its factorization.
121141110335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16403894.
The product of its (nonzero) digits is 360, while the sum is 23.
Adding to 121141110335 its reverse (533011141121), we get a palindrome (654152251456).
The spelling of 121141110335 in words is "one hundred twenty-one billion, one hundred forty-one million, one hundred ten thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •