Base | Representation |
---|---|
bin | 101111111110100101… |
… | …0100011101110010101 |
3 | 100211221110020011220021 |
4 | 1133331022203232111 |
5 | 3142002100314341 |
6 | 115155421505141 |
7 | 10305135404542 |
oct | 1377512435625 |
9 | 324843204807 |
10 | 103031651221 |
11 | 3a771754584 |
12 | 17b751121b1 |
13 | 993c9266c5 |
14 | 4db5945bc9 |
15 | 2a304819d1 |
hex | 17fd2a3b95 |
103031651221 has 2 divisors, whose sum is σ = 103031651222. Its totient is φ = 103031651220.
The previous prime is 103031651201. The next prime is 103031651227. The reversal of 103031651221 is 122156130301.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99064415025 + 3967236196 = 314745^2 + 62986^2 .
It is an emirp because it is prime and its reverse (122156130301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103031651221 - 25 = 103031651189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103031651227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51515825610 + 51515825611.
It is an arithmetic number, because the mean of its divisors is an integer number (51515825611).
Almost surely, 2103031651221 is an apocalyptic number.
It is an amenable number.
103031651221 is a deficient number, since it is larger than the sum of its proper divisors (1).
103031651221 is an equidigital number, since it uses as much as digits as its factorization.
103031651221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 103031651221 its reverse (122156130301), we get a palindrome (225187781522).
The spelling of 103031651221 in words is "one hundred three billion, thirty-one million, six hundred fifty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •