Base | Representation |
---|---|
bin | 11011100011101100100100… |
… | …110110010001100000111001 |
3 | 120220010122011022121122111112 |
4 | 123203230210312101200321 |
5 | 111341221203341124423 |
6 | 1105434352130410105 |
7 | 34346301266525021 |
oct | 3343544466214071 |
9 | 526118138548445 |
10 | 121200300333113 |
11 | 35688838941a91 |
12 | 1171551b430935 |
13 | 52821a6ccac81 |
14 | 21d01a9416a81 |
15 | e02a708b8a78 |
hex | 6e3b24d91839 |
121200300333113 has 16 divisors (see below), whose sum is σ = 127937184768000. Its totient is φ = 114499220773392.
The previous prime is 121200300333067. The next prime is 121200300333121. The reversal of 121200300333113 is 311333003002121.
It is a cyclic number.
It is not a de Polignac number, because 121200300333113 - 226 = 121200233224249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121200300333163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 413253758 + ... + 413546936.
It is an arithmetic number, because the mean of its divisors is an integer number (7996074048000).
Almost surely, 2121200300333113 is an apocalyptic number.
It is an amenable number.
121200300333113 is a deficient number, since it is larger than the sum of its proper divisors (6736884434887).
121200300333113 is a wasteful number, since it uses less digits than its factorization.
121200300333113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 354164.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 121200300333113 its reverse (311333003002121), we get a palindrome (432533303335234).
The spelling of 121200300333113 in words is "one hundred twenty-one trillion, two hundred billion, three hundred million, three hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •