Base | Representation |
---|---|
bin | 110000000111100000… |
… | …0111111001100111101 |
3 | 100212201022202101121011 |
4 | 1200033000333030331 |
5 | 3143110232212341 |
6 | 115245240435221 |
7 | 10315433063152 |
oct | 1401700771475 |
9 | 325638671534 |
10 | 103331132221 |
11 | 3a905804039 |
12 | 18039478b11 |
13 | 99899a21b5 |
14 | 5003622229 |
15 | 2a4b8dbb81 |
hex | 180f03f33d |
103331132221 has 2 divisors, whose sum is σ = 103331132222. Its totient is φ = 103331132220.
The previous prime is 103331132213. The next prime is 103331132237. The reversal of 103331132221 is 122231133301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 77726652025 + 25604480196 = 278795^2 + 160014^2 .
It is a cyclic number.
It is not a de Polignac number, because 103331132221 - 23 = 103331132213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103331132192 and 103331132201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103331132291) 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, 51665566110 + 51665566111.
It is an arithmetic number, because the mean of its divisors is an integer number (51665566111).
Almost surely, 2103331132221 is an apocalyptic number.
It is an amenable number.
103331132221 is a deficient number, since it is larger than the sum of its proper divisors (1).
103331132221 is an equidigital number, since it uses as much as digits as its factorization.
103331132221 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 103331132221 its reverse (122231133301), we get a palindrome (225562265522).
The spelling of 103331132221 in words is "one hundred three billion, three hundred thirty-one million, one hundred thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •