Base | Representation |
---|---|
bin | 111000100010000110… |
… | …0001000011001111101 |
3 | 102121100210101020121121 |
4 | 1301010030020121331 |
5 | 3442113144141013 |
6 | 131434414030541 |
7 | 11525324311036 |
oct | 1610414103175 |
9 | 377323336547 |
10 | 121403115133 |
11 | 47539991303 |
12 | 1b6417a8451 |
13 | b5a9ab6a01 |
14 | 5c39829a8d |
15 | 325826358d |
hex | 1c4430867d |
121403115133 has 2 divisors, whose sum is σ = 121403115134. Its totient is φ = 121403115132.
The previous prime is 121403115049. The next prime is 121403115139. The reversal of 121403115133 is 331511304121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107811752409 + 13591362724 = 328347^2 + 116582^2 .
It is an emirp because it is prime and its reverse (331511304121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121403115133 - 213 = 121403106941 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121403115098 and 121403115107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121403115139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60701557566 + 60701557567.
It is an arithmetic number, because the mean of its divisors is an integer number (60701557567).
Almost surely, 2121403115133 is an apocalyptic number.
It is an amenable number.
121403115133 is a deficient number, since it is larger than the sum of its proper divisors (1).
121403115133 is an equidigital number, since it uses as much as digits as its factorization.
121403115133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 121403115133 its reverse (331511304121), we get a palindrome (452914419254).
The spelling of 121403115133 in words is "one hundred twenty-one billion, four hundred three million, one hundred fifteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •