Base | Representation |
---|---|
bin | 11011100101010010110000… |
… | …110110001100000000100010 |
3 | 120220112010101002202001021112 |
4 | 123211102300312030000202 |
5 | 111400020411431200302 |
6 | 1110001015542423322 |
7 | 34360234315425056 |
oct | 3345226066140042 |
9 | 526463332661245 |
10 | 121310023303202 |
11 | 35720323677458 |
12 | 11732841431b42 |
13 | 528c641cb0346 |
14 | 21d56178c5c66 |
15 | e058434dd552 |
hex | 6e54b0d8c022 |
121310023303202 has 4 divisors (see below), whose sum is σ = 181965034954806. Its totient is φ = 60655011651600.
The previous prime is 121310023303169. The next prime is 121310023303207. The reversal of 121310023303202 is 202303320013121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 119409841005361 + 1900182297841 = 10927481^2 + 1378471^2 .
It is a super-2 number, since 2×1213100233032022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (121310023303207) by changing a digit.
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 as a sum of consecutive naturals, namely, 30327505825799 + ... + 30327505825802.
Almost surely, 2121310023303202 is an apocalyptic number.
121310023303202 is a deficient number, since it is larger than the sum of its proper divisors (60655011651604).
121310023303202 is an equidigital number, since it uses as much as digits as its factorization.
121310023303202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60655011651603.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 121310023303202 its reverse (202303320013121), we get a palindrome (323613343316323).
The spelling of 121310023303202 in words is "one hundred twenty-one trillion, three hundred ten billion, twenty-three million, three hundred three thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •