Base | Representation |
---|---|
bin | 11011100011111111110111… |
… | …011100000000101010101010 |
3 | 120220012121121211201220100011 |
4 | 123203333313130000222222 |
5 | 111342041113401410442 |
6 | 1105452055325402134 |
7 | 34350633500112055 |
oct | 3343776734005252 |
9 | 526177554656304 |
10 | 121221013310122 |
11 | 356965a7874200 |
12 | 1171954010934a |
13 | 528412830989b |
14 | 21d11b2293a9c |
15 | e0338401c117 |
hex | 6e3ff7700aaa |
121221013310122 has 24 divisors (see below), whose sum is σ = 199865791030500. Its totient is φ = 55100076546240.
The previous prime is 121221013310101. The next prime is 121221013310123. The reversal of 121221013310122 is 221013310122121.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 115686997012521 + 5534016297601 = 10755789^2 + 2352449^2 .
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 121221013310093 and 121221013310102.
It is not an unprimeable number, because it can be changed into a prime (121221013310123) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 34607254 + ... + 37948702.
Almost surely, 2121221013310122 is an apocalyptic number.
121221013310122 is a deficient number, since it is larger than the sum of its proper divisors (78644777720378).
121221013310122 is a wasteful number, since it uses less digits than its factorization.
121221013310122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3491382 (or 3491371 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 121221013310122 its reverse (221013310122121), we get a palindrome (342234323432243).
The spelling of 121221013310122 in words is "one hundred twenty-one trillion, two hundred twenty-one billion, thirteen million, three hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •