Base | Representation |
---|---|
bin | 111000011111000101… |
… | …0110011000001110101 |
3 | 102121002202022020211101 |
4 | 1300332022303001311 |
5 | 3441411314232013 |
6 | 131420405010101 |
7 | 11522656566352 |
oct | 1607612630165 |
9 | 377082266741 |
10 | 121302102133 |
11 | 47497968793 |
12 | 1b6139b3931 |
13 | b591baa0c4 |
14 | 5c2a253629 |
15 | 324e45d8dd |
hex | 1c3e2b3075 |
121302102133 has 2 divisors, whose sum is σ = 121302102134. Its totient is φ = 121302102132.
The previous prime is 121302102121. The next prime is 121302102151. The reversal of 121302102133 is 331201203121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 120064329009 + 1237773124 = 346503^2 + 35182^2 .
It is a cyclic number.
It is not a de Polignac number, because 121302102133 - 233 = 112712167541 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121302102133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121302102193) 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, 60651051066 + 60651051067.
It is an arithmetic number, because the mean of its divisors is an integer number (60651051067).
Almost surely, 2121302102133 is an apocalyptic number.
It is an amenable number.
121302102133 is a deficient number, since it is larger than the sum of its proper divisors (1).
121302102133 is an equidigital number, since it uses as much as digits as its factorization.
121302102133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 121302102133 its reverse (331201203121), we get a palindrome (452503305254).
The spelling of 121302102133 in words is "one hundred twenty-one billion, three hundred two million, one hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •