Base | Representation |
---|---|
bin | 1001011000010011101111… |
… | …1000000001100111100101 |
3 | 1100111221020002211200122211 |
4 | 2112010323320001213211 |
5 | 2322432434040121013 |
6 | 33533454530323421 |
7 | 2113051142160103 |
oct | 226047370014745 |
9 | 40457202750584 |
10 | 10313221020133 |
11 | 33168a3445439 |
12 | 11a6930a29571 |
13 | 59a6c0092965 |
14 | 27923c0d0c73 |
15 | 12d40d16123d |
hex | 9613be019e5 |
10313221020133 has 2 divisors, whose sum is σ = 10313221020134. Its totient is φ = 10313221020132.
The previous prime is 10313221020121. The next prime is 10313221020239. The reversal of 10313221020133 is 33102012231301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7778113811329 + 2535107208804 = 2788927^2 + 1592202^2 .
It is a cyclic number.
It is not a de Polignac number, because 10313221020133 - 25 = 10313221020101 is a prime.
It is a super-2 number, since 2×103132210201332 (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 (10313221020433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5156610510066 + 5156610510067.
It is an arithmetic number, because the mean of its divisors is an integer number (5156610510067).
Almost surely, 210313221020133 is an apocalyptic number.
It is an amenable number.
10313221020133 is a deficient number, since it is larger than the sum of its proper divisors (1).
10313221020133 is an equidigital number, since it uses as much as digits as its factorization.
10313221020133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 10313221020133 its reverse (33102012231301), we get a palindrome (43415233251434).
The spelling of 10313221020133 in words is "ten trillion, three hundred thirteen billion, two hundred twenty-one million, twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •