Base | Representation |
---|---|
bin | 11011100101010101110110… |
… | …000111101101111001011011 |
3 | 120220112102220202112120111012 |
4 | 123211111312013231321123 |
5 | 111400044201222310021 |
6 | 1110002324213124135 |
7 | 34360412324446052 |
oct | 3345256607557133 |
9 | 526472822476435 |
10 | 121313333010011 |
11 | 3572177194113a |
12 | 1173340592964b |
13 | 528ca4b8b093c |
14 | 21d584d2ab399 |
15 | e05988d5c35b |
hex | 6e55761ede5b |
121313333010011 has 8 divisors (see below), whose sum is σ = 121929782350464. Its totient is φ = 120696890191360.
The previous prime is 121313333010007. The next prime is 121313333010059. The reversal of 121313333010011 is 110010333313121.
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 121313333010011 - 22 = 121313333010007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121313333010061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38122646 + ... + 41182068.
It is an arithmetic number, because the mean of its divisors is an integer number (15241222793808).
Almost surely, 2121313333010011 is an apocalyptic number.
121313333010011 is a deficient number, since it is larger than the sum of its proper divisors (616449340453).
121313333010011 is a wasteful number, since it uses less digits than its factorization.
121313333010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3260901.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 121313333010011 its reverse (110010333313121), we get a palindrome (231323666323132).
The spelling of 121313333010011 in words is "one hundred twenty-one trillion, three hundred thirteen billion, three hundred thirty-three million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •