Base | Representation |
---|---|
bin | 111000010110100000… |
… | …0001111001000111101 |
3 | 102120100200102022000021 |
4 | 1300231000033020331 |
5 | 3440314103333041 |
6 | 131332040332141 |
7 | 11512562025313 |
oct | 1605500171075 |
9 | 376320368007 |
10 | 121014121021 |
11 | 4735a353272 |
12 | 1b553474051 |
13 | b547329a91 |
14 | 5bddccc0b3 |
15 | 3234025cd1 |
hex | 1c2d00f23d |
121014121021 has 2 divisors, whose sum is σ = 121014121022. Its totient is φ = 121014121020.
The previous prime is 121014121009. The next prime is 121014121027. The reversal of 121014121021 is 120121410121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 114727851225 + 6286269796 = 338715^2 + 79286^2 .
It is a cyclic number.
It is not a de Polignac number, because 121014121021 - 227 = 120879903293 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121014120986 and 121014121004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121014121027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60507060510 + 60507060511.
It is an arithmetic number, because the mean of its divisors is an integer number (60507060511).
Almost surely, 2121014121021 is an apocalyptic number.
It is an amenable number.
121014121021 is a deficient number, since it is larger than the sum of its proper divisors (1).
121014121021 is an equidigital number, since it uses as much as digits as its factorization.
121014121021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 121014121021 its reverse (120121410121), we get a palindrome (241135531142).
The spelling of 121014121021 in words is "one hundred twenty-one billion, fourteen million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •