Base | Representation |
---|---|
bin | 111000011111110111… |
… | …0101010001010111101 |
3 | 102121011120120020110101 |
4 | 1300333232222022331 |
5 | 3441440014432003 |
6 | 131423142041101 |
7 | 11523425236405 |
oct | 1607756521275 |
9 | 377146506411 |
10 | 121328280253 |
11 | 475007187a4 |
12 | 1b620719191 |
13 | b59744460b |
14 | 5c2d909805 |
15 | 32518d011d |
hex | 1c3fbaa2bd |
121328280253 has 2 divisors, whose sum is σ = 121328280254. Its totient is φ = 121328280252.
The previous prime is 121328280251. The next prime is 121328280299. The reversal of 121328280253 is 352082823121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 61930304164 + 59397976089 = 248858^2 + 243717^2 .
It is an emirp because it is prime and its reverse (352082823121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121328280253 - 21 = 121328280251 is a prime.
Together with 121328280251, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121328280251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60664140126 + 60664140127.
It is an arithmetic number, because the mean of its divisors is an integer number (60664140127).
Almost surely, 2121328280253 is an apocalyptic number.
It is an amenable number.
121328280253 is a deficient number, since it is larger than the sum of its proper divisors (1).
121328280253 is an equidigital number, since it uses as much as digits as its factorization.
121328280253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46080, while the sum is 37.
The spelling of 121328280253 in words is "one hundred twenty-one billion, three hundred twenty-eight million, two hundred eighty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •