Base | Representation |
---|---|
bin | 111000010110101101… |
… | …1010111100001000111 |
3 | 102120101011210122010011 |
4 | 1300231123113201013 |
5 | 3440322413430343 |
6 | 131332453011051 |
7 | 11513006336512 |
oct | 1605533274107 |
9 | 376334718104 |
10 | 121021233223 |
11 | 47363370820 |
12 | 1b555923a87 |
13 | b54894a097 |
14 | 5c00c1dd79 |
15 | 323497d29d |
hex | 1c2d6d7847 |
121021233223 has 8 divisors (see below), whose sum is σ = 134187478416. Its totient is φ = 108215707200.
The previous prime is 121021233211. The next prime is 121021233247. The reversal of 121021233223 is 322332120121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121021233223 - 221 = 121019136071 is a prime.
It is a super-2 number, since 2×1210212332232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121021233194 and 121021233203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121021233293) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 90179086 + ... + 90180427.
It is an arithmetic number, because the mean of its divisors is an integer number (16773434802).
Almost surely, 2121021233223 is an apocalyptic number.
121021233223 is a deficient number, since it is larger than the sum of its proper divisors (13166245193).
121021233223 is a wasteful number, since it uses less digits than its factorization.
121021233223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 180359585.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 121021233223 its reverse (322332120121), we get a palindrome (443353353344).
The spelling of 121021233223 in words is "one hundred twenty-one billion, twenty-one million, two hundred thirty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •