Base | Representation |
---|---|
bin | 11011100011111111110111… |
… | …111010000111011011001010 |
3 | 120220012121122101120212010110 |
4 | 123203333313322013123022 |
5 | 111342041122411431442 |
6 | 1105452100210455150 |
7 | 34350633624151602 |
oct | 3343776772073312 |
9 | 526177571525113 |
10 | 121221021202122 |
11 | 35696601274616 |
12 | 117195428944b6 |
13 | 5284129b40aca |
14 | 21d11b3349c02 |
15 | e03384a7a69c |
hex | 6e3ff7e876ca |
121221021202122 has 32 divisors (see below), whose sum is σ = 246134099837952. Its totient is φ = 39792024551664.
The previous prime is 121221021202117. The next prime is 121221021202129. The reversal of 121221021202122 is 221202120122121.
It is a super-2 number, since 2×1212210212021222 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (121221021202129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 43701538 + ... + 46392525.
It is an arithmetic number, because the mean of its divisors is an integer number (7691690619936).
Almost surely, 2121221021202122 is an apocalyptic number.
121221021202122 is an abundant number, since it is smaller than the sum of its proper divisors (124913078635830).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121221021202122 is a wasteful number, since it uses less digits than its factorization.
121221021202122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90097482.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 121221021202122 its reverse (221202120122121), we get a palindrome (342423141324243).
The spelling of 121221021202122 in words is "one hundred twenty-one trillion, two hundred twenty-one billion, twenty-one million, two hundred two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •