Base | Representation |
---|---|
bin | 111000011001001000… |
… | …0101110110101010111 |
3 | 102120120211101211122210 |
4 | 1300302100232311113 |
5 | 3441004144044343 |
6 | 131344511124503 |
7 | 11515012555026 |
oct | 1606220566527 |
9 | 376524354583 |
10 | 121102331223 |
11 | 473a5121965 |
12 | 1b578b13733 |
13 | b55c6a3173 |
14 | 5c0b8d08bd |
15 | 323bb4c333 |
hex | 1c3242ed57 |
121102331223 has 8 divisors (see below), whose sum is σ = 165833823088. Its totient is φ = 78552863424.
The previous prime is 121102331221. The next prime is 121102331249. The reversal of 121102331223 is 322133201121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121102331223 - 21 = 121102331221 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121102331223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121102331221) 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 in 7 ways as a sum of consecutive naturals, for example, 545505886 + ... + 545506107.
It is an arithmetic number, because the mean of its divisors is an integer number (20729227886).
Almost surely, 2121102331223 is an apocalyptic number.
121102331223 is a deficient number, since it is larger than the sum of its proper divisors (44731491865).
121102331223 is a wasteful number, since it uses less digits than its factorization.
121102331223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1091012033.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 121102331223 its reverse (322133201121), we get a palindrome (443235532344).
The spelling of 121102331223 in words is "one hundred twenty-one billion, one hundred two million, three hundred thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •