Base | Representation |
---|---|
bin | 10010111011111100010… |
… | …000001101101011000101 |
3 | 11121101220200112202022021 |
4 | 102323330100031223011 |
5 | 132310041412412013 |
6 | 2433451541203141 |
7 | 163005505316134 |
oct | 22737420155305 |
9 | 4541820482267 |
10 | 1301312232133 |
11 | 461979914661 |
12 | 190252a004b1 |
13 | 95936c25c64 |
14 | 46dab97191b |
15 | 23cb422ea8d |
hex | 12efc40dac5 |
1301312232133 has 2 divisors, whose sum is σ = 1301312232134. Its totient is φ = 1301312232132.
The previous prime is 1301312232067. The next prime is 1301312232151. The reversal of 1301312232133 is 3312322131031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 865973552929 + 435338679204 = 930577^2 + 659802^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1301312232133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1301312232098 and 1301312232107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1301312232163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 650656116066 + 650656116067.
It is an arithmetic number, because the mean of its divisors is an integer number (650656116067).
Almost surely, 21301312232133 is an apocalyptic number.
It is an amenable number.
1301312232133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1301312232133 is an equidigital number, since it uses as much as digits as its factorization.
1301312232133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 1301312232133 its reverse (3312322131031), we get a palindrome (4613634363164).
The spelling of 1301312232133 in words is "one trillion, three hundred one billion, three hundred twelve million, two hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •