Base | Representation |
---|---|
bin | 11011100010100011111011… |
… | …101011111000100100001111 |
3 | 120212212011211100212001121122 |
4 | 123202203323223320210033 |
5 | 111333431432341113203 |
6 | 1105334452215551155 |
7 | 34340540341462604 |
oct | 3342437353704417 |
9 | 525764740761548 |
10 | 121122300332303 |
11 | 356587519819a6 |
12 | 1170239138b4bb |
13 | 5277a2634003a |
14 | 21ca4ca1366ab |
15 | e00a07cac538 |
hex | 6e28fbaf890f |
121122300332303 has 2 divisors, whose sum is σ = 121122300332304. Its totient is φ = 121122300332302.
The previous prime is 121122300332263. The next prime is 121122300332359. The reversal of 121122300332303 is 303233003221121.
It is a weak prime.
It is an emirp because it is prime and its reverse (303233003221121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121122300332303 - 212 = 121122300328207 is a prime.
It is a super-2 number, since 2×1211223003323032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121122300332203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60561150166151 + 60561150166152.
It is an arithmetic number, because the mean of its divisors is an integer number (60561150166152).
Almost surely, 2121122300332303 is an apocalyptic number.
121122300332303 is a deficient number, since it is larger than the sum of its proper divisors (1).
121122300332303 is an equidigital number, since it uses as much as digits as its factorization.
121122300332303 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 121122300332303 its reverse (303233003221121), we get a palindrome (424355303553424).
The spelling of 121122300332303 in words is "one hundred twenty-one trillion, one hundred twenty-two billion, three hundred million, three hundred thirty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •