Base | Representation |
---|---|
bin | 11011100101010100101101… |
… | …010111001100110011110110 |
3 | 120220112022202200121201002022 |
4 | 123211110231113030303312 |
5 | 111400034201224111042 |
6 | 1110002003125513142 |
7 | 34360340143036103 |
oct | 3345245527146366 |
9 | 526468680551068 |
10 | 121312112332022 |
11 | 357211a58a1757 |
12 | 11733124b727b2 |
13 | 528c8b5a29581 |
14 | 21d5775117aaa |
15 | e05916ad9cd2 |
hex | 6e552d5cccf6 |
121312112332022 has 8 divisors (see below), whose sum is σ = 192672178409736. Its totient is φ = 57088052862112.
The previous prime is 121312112331973. The next prime is 121312112332043. The reversal of 121312112332022 is 220233211213121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1213121123320223 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 121312112331982 and 121312112332000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1784001651908 + ... + 1784001651975.
It is an arithmetic number, because the mean of its divisors is an integer number (24084022301217).
Almost surely, 2121312112332022 is an apocalyptic number.
121312112332022 is a deficient number, since it is larger than the sum of its proper divisors (71360066077714).
121312112332022 is a wasteful number, since it uses less digits than its factorization.
121312112332022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3568003303902.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 121312112332022 its reverse (220233211213121), we get a palindrome (341545323545143).
The spelling of 121312112332022 in words is "one hundred twenty-one trillion, three hundred twelve billion, one hundred twelve million, three hundred thirty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •