Base | Representation |
---|---|
bin | 111000011001101110… |
… | …0100001111001110010 |
3 | 102120122012210100010221 |
4 | 1300303130201321302 |
5 | 3441024240414302 |
6 | 131350501043254 |
7 | 11515343503012 |
oct | 1606334417162 |
9 | 376565710127 |
10 | 121122201202 |
11 | 47405363532 |
12 | 1b5836b652a |
13 | b56383c352 |
14 | 5c103c3c42 |
15 | 323d774937 |
hex | 1c33721e72 |
121122201202 has 4 divisors (see below), whose sum is σ = 181683301806. Its totient is φ = 60561100600.
The previous prime is 121122201143. The next prime is 121122201209. The reversal of 121122201202 is 202102221121.
It is a happy number.
121122201202 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 202102221121 = 73 ⋅2768523577.
It can be written as a sum of positive squares in only one way, i.e., 65637927601 + 55484273601 = 256199^2 + 235551^2 .
It is not an unprimeable number, because it can be changed into a prime (121122201209) 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, 30280550299 + ... + 30280550302.
Almost surely, 2121122201202 is an apocalyptic number.
121122201202 is a deficient number, since it is larger than the sum of its proper divisors (60561100604).
121122201202 is an equidigital number, since it uses as much as digits as its factorization.
121122201202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60561100603.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 121122201202 its reverse (202102221121), we get a palindrome (323224422323).
The spelling of 121122201202 in words is "one hundred twenty-one billion, one hundred twenty-two million, two hundred one thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •