Base | Representation |
---|---|
bin | 10111011100010110010111… |
… | …000000000111010111011111 |
3 | 111112001120102220111021212011 |
4 | 113130112113000013113133 |
5 | 102003220400133032041 |
6 | 1003140544504252051 |
7 | 30500650663214233 |
oct | 2734262700072737 |
9 | 445046386437764 |
10 | 103103223330271 |
11 | 2a94091674676a |
12 | b692118a71027 |
13 | 456b7912022a8 |
14 | 1b66318ca85c3 |
15 | bdbe41208e81 |
hex | 5dc5970075df |
103103223330271 has 2 divisors, whose sum is σ = 103103223330272. Its totient is φ = 103103223330270.
The previous prime is 103103223330077. The next prime is 103103223330287. The reversal of 103103223330271 is 172033322301301.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103103223330271 - 213 = 103103223322079 is a prime.
It is a super-3 number, since 3×1031032233302713 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103103223330071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51551611665135 + 51551611665136.
It is an arithmetic number, because the mean of its divisors is an integer number (51551611665136).
Almost surely, 2103103223330271 is an apocalyptic number.
103103223330271 is a deficient number, since it is larger than the sum of its proper divisors (1).
103103223330271 is an equidigital number, since it uses as much as digits as its factorization.
103103223330271 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13608, while the sum is 31.
Adding to 103103223330271 its reverse (172033322301301), we get a palindrome (275136545631572).
The spelling of 103103223330271 in words is "one hundred three trillion, one hundred three billion, two hundred twenty-three million, three hundred thirty thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •