Base | Representation |
---|---|
bin | 111000010110000111… |
… | …1000001110010110101 |
3 | 102120022210010220220212 |
4 | 1300230033001302311 |
5 | 3440302303040201 |
6 | 131330500035205 |
7 | 11512344260642 |
oct | 1605417016265 |
9 | 376283126825 |
10 | 121001221301 |
11 | 47353042544 |
12 | 1b54b092b05 |
13 | b5447613cc |
14 | 5bdc2d0dc9 |
15 | 3232d28abb |
hex | 1c2c3c1cb5 |
121001221301 has 2 divisors, whose sum is σ = 121001221302. Its totient is φ = 121001221300.
The previous prime is 121001221279. The next prime is 121001221331. The reversal of 121001221301 is 103122100121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78430803025 + 42570418276 = 280055^2 + 206326^2 .
It is an emirp because it is prime and its reverse (103122100121) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121001221301 is a prime.
It is a super-2 number, since 2×1210012213012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121001221331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60500610650 + 60500610651.
It is an arithmetic number, because the mean of its divisors is an integer number (60500610651).
Almost surely, 2121001221301 is an apocalyptic number.
It is an amenable number.
121001221301 is a deficient number, since it is larger than the sum of its proper divisors (1).
121001221301 is an equidigital number, since it uses as much as digits as its factorization.
121001221301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 121001221301 its reverse (103122100121), we get a palindrome (224123321422).
The spelling of 121001221301 in words is "one hundred twenty-one billion, one million, two hundred twenty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •