Base | Representation |
---|---|
bin | 11001000010011110010111… |
… | …001000001101000000101010 |
3 | 112102220111001220111221100222 |
4 | 121002132113020031000222 |
5 | 103413211210203342302 |
6 | 1030112552023330042 |
7 | 32123665020600653 |
oct | 3102362710150052 |
9 | 472814056457328 |
10 | 110121202012202 |
11 | 320a7159755927 |
12 | 104262878b0922 |
13 | 495a500505b44 |
14 | 1d29c74b7c52a |
15 | cae789e9eda2 |
hex | 64279720d02a |
110121202012202 has 4 divisors (see below), whose sum is σ = 165181803018306. Its totient is φ = 55060601006100.
The previous prime is 110121202012163. The next prime is 110121202012207. The reversal of 110121202012202 is 202210202121011.
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., 63803527019521 + 46317674992681 = 7987711^2 + 6805709^2 .
It is a super-2 number, since 2×1101212020122022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110121202012207) 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, 27530300503049 + ... + 27530300503052.
Almost surely, 2110121202012202 is an apocalyptic number.
110121202012202 is a deficient number, since it is larger than the sum of its proper divisors (55060601006104).
110121202012202 is an equidigital number, since it uses as much as digits as its factorization.
110121202012202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55060601006103.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 110121202012202 its reverse (202210202121011), we get a palindrome (312331404133213).
The spelling of 110121202012202 in words is "one hundred ten trillion, one hundred twenty-one billion, two hundred two million, twelve thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •