Base | Representation |
---|---|
bin | 111000010110101101… |
… | …1010100110001011001 |
3 | 102120101011210001200122 |
4 | 1300231123110301121 |
5 | 3440322413100402 |
6 | 131332452443025 |
7 | 11513006261645 |
oct | 1605533246131 |
9 | 376334701618 |
10 | 121021221977 |
11 | 47363363327 |
12 | 1b555919475 |
13 | b548944c26 |
14 | 5c00c19c25 |
15 | 3234979ca2 |
hex | 1c2d6d4c59 |
121021221977 has 2 divisors, whose sum is σ = 121021221978. Its totient is φ = 121021221976.
The previous prime is 121021221967. The next prime is 121021222009. The reversal of 121021221977 is 779122120121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 93088450816 + 27932771161 = 305104^2 + 167131^2 .
It is an emirp because it is prime and its reverse (779122120121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121021221977 - 210 = 121021220953 is a prime.
It is a super-2 number, since 2×1210212219772 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (121021221967) 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 as a sum of consecutive naturals, namely, 60510610988 + 60510610989.
It is an arithmetic number, because the mean of its divisors is an integer number (60510610989).
Almost surely, 2121021221977 is an apocalyptic number.
It is an amenable number.
121021221977 is a deficient number, since it is larger than the sum of its proper divisors (1).
121021221977 is an equidigital number, since it uses as much as digits as its factorization.
121021221977 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7056, while the sum is 35.
The spelling of 121021221977 in words is "one hundred twenty-one billion, twenty-one million, two hundred twenty-one thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •