Base | Representation |
---|---|
bin | 1001011001010110011101… |
… | …1101011000100111011101 |
3 | 1100120122110100200222111021 |
4 | 2112111213131120213131 |
5 | 2323231124304300013 |
6 | 33550020115124141 |
7 | 2114254040650012 |
oct | 226254735304735 |
9 | 40518410628437 |
10 | 10331132103133 |
11 | 3323454816176 |
12 | 11aa2ab2a3651 |
13 | 59c2b5a6021a |
14 | 27a05abb3709 |
15 | 12db0a803a8d |
hex | 965677589dd |
10331132103133 has 2 divisors, whose sum is σ = 10331132103134. Its totient is φ = 10331132103132.
The previous prime is 10331132103037. The next prime is 10331132103169. The reversal of 10331132103133 is 33130123113301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5538806920089 + 4792325183044 = 2353467^2 + 2189138^2 .
It is a cyclic number.
It is not a de Polignac number, because 10331132103133 - 241 = 8132108847581 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10331132103098 and 10331132103107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10331132103833) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5165566051566 + 5165566051567.
It is an arithmetic number, because the mean of its divisors is an integer number (5165566051567).
Almost surely, 210331132103133 is an apocalyptic number.
It is an amenable number.
10331132103133 is a deficient number, since it is larger than the sum of its proper divisors (1).
10331132103133 is an equidigital number, since it uses as much as digits as its factorization.
10331132103133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 10331132103133 its reverse (33130123113301), we get a palindrome (43461255216434).
The spelling of 10331132103133 in words is "ten trillion, three hundred thirty-one billion, one hundred thirty-two million, one hundred three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •