Base | Representation |
---|---|
bin | 1001010111100111000010… |
… | …1100001010101100010101 |
3 | 1100110210020212221120201011 |
4 | 2111321300230022230111 |
5 | 2322233400340432013 |
6 | 33524152142132221 |
7 | 2112144613665322 |
oct | 225716054125425 |
9 | 40423225846634 |
10 | 10301222202133 |
11 | 33117a6420925 |
12 | 11a4542581071 |
13 | 59952a253155 |
14 | 2788206ddb49 |
15 | 12ce59a75c3d |
hex | 95e70b0ab15 |
10301222202133 has 2 divisors, whose sum is σ = 10301222202134. Its totient is φ = 10301222202132.
The previous prime is 10301222202119. The next prime is 10301222202197. The reversal of 10301222202133 is 33120222210301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5908312212804 + 4392909989329 = 2430702^2 + 2095927^2 .
It is a cyclic number.
It is not a de Polignac number, because 10301222202133 - 229 = 10300685331221 is a prime.
It is a super-2 number, since 2×103012222021332 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10301222200133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5150611101066 + 5150611101067.
It is an arithmetic number, because the mean of its divisors is an integer number (5150611101067).
Almost surely, 210301222202133 is an apocalyptic number.
It is an amenable number.
10301222202133 is a deficient number, since it is larger than the sum of its proper divisors (1).
10301222202133 is an equidigital number, since it uses as much as digits as its factorization.
10301222202133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 10301222202133 its reverse (33120222210301), we get a palindrome (43421444412434).
The spelling of 10301222202133 in words is "ten trillion, three hundred one billion, two hundred twenty-two million, two hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •