Base | Representation |
---|---|
bin | 111000011100101110… |
… | …1011011101011001101 |
3 | 102120220020122120211102 |
4 | 1300321131123223031 |
5 | 3441231103214013 |
6 | 131404503432445 |
7 | 11521010233631 |
oct | 1607135335315 |
9 | 376806576742 |
10 | 121223101133 |
11 | 4745730a102 |
12 | 1b5b1455725 |
13 | b57b709654 |
14 | 5c1d96adc1 |
15 | 3247555d58 |
hex | 1c3975bacd |
121223101133 has 4 divisors (see below), whose sum is σ = 123210365148. Its totient is φ = 119235837120.
The previous prime is 121223101121. The next prime is 121223101159. The reversal of 121223101133 is 331101322121.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6652359844 + 114570741289 = 81562^2 + 338483^2 .
It is a cyclic number.
It is not a de Polignac number, because 121223101133 - 222 = 121218906829 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121223121133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 993631916 + ... + 993632037.
It is an arithmetic number, because the mean of its divisors is an integer number (30802591287).
Almost surely, 2121223101133 is an apocalyptic number.
It is an amenable number.
121223101133 is a deficient number, since it is larger than the sum of its proper divisors (1987264015).
121223101133 is an equidigital number, since it uses as much as digits as its factorization.
121223101133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1987264014.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 121223101133 its reverse (331101322121), we get a palindrome (452324423254).
The spelling of 121223101133 in words is "one hundred twenty-one billion, two hundred twenty-three million, one hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •