Base | Representation |
---|---|
bin | 111000011100101101… |
… | …0000100110011011011 |
3 | 102120220011222212112121 |
4 | 1300321122010303123 |
5 | 3441230342033034 |
6 | 131404432522111 |
7 | 11520666606664 |
oct | 1607132046333 |
9 | 376804885477 |
10 | 121222221019 |
11 | 47456868939 |
12 | 1b5b10b0337 |
13 | b57b48bb83 |
14 | 5c1d7bc36b |
15 | 32474301b4 |
hex | 1c39684cdb |
121222221019 has 8 divisors (see below), whose sum is σ = 121892792112. Its totient is φ = 120552935040.
The previous prime is 121222220969. The next prime is 121222221041. The reversal of 121222221019 is 910122222121.
It is a happy number.
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 121222221019 - 231 = 119074737371 is a prime.
It is a super-2 number, since 2×1212222210192 (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 = 121222220984 and 121222221002.
It is not an unprimeable number, because it can be changed into a prime (121222221049) 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, 131794 + ... + 509719.
It is an arithmetic number, because the mean of its divisors is an integer number (15236599014).
Almost surely, 2121222221019 is an apocalyptic number.
121222221019 is a deficient number, since it is larger than the sum of its proper divisors (670571093).
121222221019 is an equidigital number, since it uses as much as digits as its factorization.
121222221019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 642557.
The product of its (nonzero) digits is 576, while the sum is 25.
The spelling of 121222221019 in words is "one hundred twenty-one billion, two hundred twenty-two million, two hundred twenty-one thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •